Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments.
Daniel R. PageRoberto Solis-ObaMarten MaackPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- flowshop
- makespan minimization
- scheduling problem
- processing times
- unrelated parallel machines
- parallel machines
- scheduling jobs
- setup times
- release dates
- tabu search
- single machine
- completion times
- sequence dependent setup times
- special case
- job shop
- total weighted tardiness
- single machine scheduling problem
- polynomially solvable
- job shop scheduling problem
- identical parallel machines
- batch processing
- metaheuristic