Bicriteria scheduling to minimize total late work and maximum tardiness with preemption.
Rubing ChenJinjiang YuanC. T. NgT. C. E. ChengPublished in: Comput. Ind. Eng. (2021)
Keyphrases
- minimize total
- maximum tardiness
- parallel machines
- bicriteria
- scheduling problem
- minimizing makespan
- single machine
- flowshop
- completion times
- release dates
- single machine scheduling problem
- precedence constraints
- efficient solutions
- processing times
- tabu search
- integer linear programming
- parallel computing
- shortest path problem
- total cost
- upper bound
- np hard
- special case
- genetic algorithm
- lot sizing
- branch and bound algorithm