Approximate and branch-and-bound algorithms for the parallel machine scheduling problem with a single server.
Guo-Sheng LiuJin-Jin LiHai-Dong YangGeorge Q. HuangPublished in: J. Oper. Res. Soc. (2019)
Keyphrases
- single server
- branch and bound algorithm
- parallel machine scheduling problem
- parallel machines
- sequence dependent setup times
- scheduling problem
- release dates
- setup times
- precedence constraints
- single machine scheduling problem
- branch and bound
- np hard
- lower bound
- maximum lateness
- special case
- upper bound
- state dependent
- optimal solution
- combinatorial optimization
- strongly np hard
- lagrangian relaxation
- queueing networks
- markov chain
- heavy traffic
- single machine
- queue length
- tabu search
- parallel computing
- holding cost
- shared memory
- cost function
- search space
- flowshop