Minimizing makespan on parallel batch processing machines with two-dimensional rectangular jobs.
Shengchao ZhouZhaohong JiaMingzhou JinNi DuPublished in: Comput. Ind. Eng. (2022)
Keyphrases
- batch processing machines
- minimizing makespan
- maximum lateness
- flowshop
- scheduling problem
- single machine
- parallel machines
- precedence constraints
- packing problem
- guillotine cutting
- release dates
- sequence dependent setup times
- setup times
- special case
- processing times
- bicriteria
- np hard
- tabu search
- single machine scheduling problem
- parallel computing
- strongly np hard
- identical machines
- branch and bound algorithm
- permutation flowshop
- shared memory
- search space
- search algorithm