Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost.
Shuguang LiZhichao GengPublished in: Inf. Process. Lett. (2023)
Keyphrases
- minimizing makespan
- flowshop
- bicriteria
- scheduling problem
- maximum tardiness
- parallel machines
- identical machines
- sequence dependent setup times
- single machine
- setup times
- processing times
- manufacturing cell
- precedence constraints
- np hard
- completion times
- batch processing
- release dates
- shared memory
- tabu search
- strongly np hard
- special case
- single server
- efficient solutions
- multiple objectives
- dynamic programming