Stochastic Minimization of the Makespan in Flow Shops with Identical Machines and Buffers of Arbitrary Size.
Masaaki KijimaNaoki MakimotoHiroshi ShirakawaPublished in: Oper. Res. (1990)
Keyphrases
- arbitrary size
- identical machines
- processing times
- scheduling problem
- single machine
- scheduling jobs
- job scheduling
- release dates
- flowshop
- precedence constraints
- setup times
- objective function
- texture synthesis
- lower bound
- production system
- single machine scheduling problem
- batch processing
- tabu search
- resource consumption
- parallel machines
- polynomial time approximation
- parallel algorithm
- search space