Combinatorial Benders' Cut for the Admission Control Decision in Flow Shop Scheduling Problems with Queue Time Constraints.
Rudi NurdiansyahI-Hsuan HongPublished in: APMS (1) (2018)
Keyphrases
- scheduling problem
- flowshop
- admission control
- precedence constraints
- end to end
- processing times
- single machine
- setup times
- np hard
- quality of service
- parallel machines
- resource consumption
- special case
- job shop
- minimum cost
- tabu search
- sequence dependent setup times
- resource management
- job shop scheduling
- job shop scheduling problem
- single server
- genetic algorithm
- release dates
- control policy
- production system
- queue length
- maximum lateness
- completion times
- decomposition algorithm
- web server
- lower bound
- search algorithm