Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families.
Fan YangMorteza DavariWenchao WeiBen HermansRoel LeusPublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- batch processing
- identical machines
- scheduling problem
- scheduling jobs
- single machine
- flowshop
- processing times
- parallel machines
- release dates
- maximum lateness
- batch processing machines
- setup times
- job scheduling
- precedence constraints
- sequence dependent setup times
- unrelated parallel machines
- release times
- parallel machine scheduling problem
- scheduling decisions
- job processing times
- single machine scheduling problem
- completion times
- tabu search
- identical parallel machines
- tardiness penalties
- special case
- preventive maintenance
- job shop
- resource consumption
- parallel processing
- evolutionary algorithm
- production scheduling
- distributed memory
- massively parallel
- limited capacity
- dynamic programming
- np hard
- shortest processing time