Solving an Unrelated Parallel Machines Scheduling Problem with machine- and job-dependent setups and precedence constraints considering Support Machines.
María-Luisa Muñoz-DíazAlejandro Escudero-SantanaAntonio Lorenzo-EspejoPublished in: Comput. Oper. Res. (2024)
Keyphrases
- scheduling problem
- flowshop
- precedence constraints
- unrelated parallel machines
- parallel machines
- maximum lateness
- setup times
- sequence dependent setup times
- identical machines
- single machine
- processing times
- release dates
- strongly np hard
- single machine scheduling problem
- identical parallel machines
- total tardiness
- np hard
- scheduling jobs
- job shop
- tabu search
- total weighted tardiness
- completion times
- open shop
- special case
- single server
- job shop scheduling problem