Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations.
Abdelhak ElidrissiRachid BenmansourKeramat HasaniFrank WernerPublished in: Comput. Oper. Res. (2024)
Keyphrases
- parallel machines
- single server
- scheduling problem
- sequence dependent setup times
- unrelated parallel machines
- precedence constraints
- massively parallel
- total tardiness
- minimize total
- setup times
- scheduling jobs
- shared memory
- release dates
- parallel computing
- open shop
- queue length
- flowshop
- information systems
- post processing
- particle swarm optimization
- dynamic programming
- job shop
- lot sizing
- special case