On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine.
Syamantak DasAndreas WiesePublished in: ESA (2017)
Keyphrases
- flowshop
- batch processing
- parallel machines
- scheduling problem
- identical machines
- scheduling jobs
- processing times
- single machine
- unrelated parallel machines
- parallel machine scheduling problem
- sequence dependent setup times
- strongly np hard
- minimizing makespan
- total tardiness
- setup times
- identical parallel machines
- wafer fabrication
- open shop
- release dates
- special case
- minimize total
- tabu search
- response time
- limited capacity
- optimal scheduling
- social networks
- genetic algorithm
- database