On Pinedo's Conjecture for Scheduling in a Stochastic Flow Shop.
S. SureshR. D. FoleyS. Elizabeth DickeyPublished in: Oper. Res. (1985)
Keyphrases
- scheduling problem
- flowshop
- unrelated parallel machines
- sequence dependent setup times
- job shop
- setup times
- parallel machines
- single machine
- maximum lateness
- processing times
- preventive maintenance
- flowshop scheduling
- np hard
- precedence constraints
- manufacturing cell
- minimizing makespan
- release dates
- tabu search
- job shop scheduling
- permutation flowshop
- makespan minimization
- job processing times
- flowshop scheduling problems
- open shop
- asymptotic optimality
- special case
- flexible manufacturing systems
- strongly np hard
- sufficient conditions