A New Dispatching Rule for the Stochastic Single-Machine Scheduling Problem.
Umar Al-TurkiAbdulbasit AndijaniShaikh ArifulsalamPublished in: Simul. (2004)
Keyphrases
- upper bound
- single machine scheduling problem
- branch and bound algorithm
- lower bound
- single machine
- dispatching rule
- production scheduling
- precedence constraints
- processing times
- lagrangian relaxation
- flexible manufacturing systems
- combinatorial optimization
- scheduling problem
- search procedure
- resource consumption
- real time
- dynamic programming
- computational complexity