Makespan Minimization for a Two-Machine Scheduling Problem with a Single Server.
Keramat HasaniSvetalana KravchenkoFrank WernerPublished in: MIM (2013)
Keyphrases
- makespan minimization
- parallel machines
- single server
- scheduling problem
- flowshop
- retrial queue
- sequence dependent setup times
- setup times
- total weighted tardiness
- processing times
- single machine
- state dependent
- np hard
- job processing times
- precedence constraints
- strongly np hard
- release dates
- heavy traffic
- job shop scheduling problem
- special case
- tabu search
- identical parallel machines
- parallel computing
- shared memory
- job shop
- holding cost
- optimal solution
- markov chain