An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan.
Cheng HeJing WuJinglei XuJunling WangPublished in: RAIRO Oper. Res. (2023)
Keyphrases
- job processing times
- release dates
- single machine
- scheduling problem
- batch processing machines
- maximum lateness
- parallel machines
- flowshop
- processing times
- minimize total
- scheduling jobs
- identical machines
- single machine scheduling problem
- precedence constraints
- batch processing
- tardiness cost
- sequence dependent setup times
- setup times
- completion times
- unrelated parallel machines
- identical parallel machines
- holding cost
- bicriteria
- distributed memory
- np hard
- parallel processors
- total cost
- branch and bound algorithm
- parallel processing
- tabu search
- special case
- database systems
- job shop
- single server
- weighted sum
- multiprocessor systems
- minimizing makespan