Trade-off solutions in a single-machine scheduling problem for minimizing total earliness and maximum tardiness.
Chin-Chia WuWen-Chiung LeeJuinn-Ming YouPublished in: Int. J. Syst. Sci. (2000)
Keyphrases
- single machine scheduling problem
- maximum tardiness
- completion times
- single machine scheduling
- branch and bound algorithm
- release dates
- sequence dependent setup times
- single machine
- processing times
- scheduling problem
- bicriteria
- weighted sum
- optimal solution
- precedence constraints
- combinatorial optimization
- flowshop
- search procedure
- hybrid algorithm
- resource consumption
- lower bound
- efficient solutions
- lp relaxation
- solution quality
- minimizing makespan
- multi objective
- lagrangian relaxation
- linear program
- computational efficiency