Scheduling batches in flowshop with limited buffers in the shampoo industry.
R. BelaidVincent T'kindtCarl EssweinPublished in: Eur. J. Oper. Res. (2012)
Keyphrases
- scheduling problem
- flowshop
- preventive maintenance
- maximum lateness
- sequence dependent setup times
- single machine
- setup times
- parallel machines
- minimizing makespan
- total tardiness
- np hard
- flowshop scheduling
- minimizing total tardiness
- makespan minimization
- processing times
- tabu search
- job shop scheduling problem
- release dates
- unrelated parallel machines
- precedence constraints
- job shop
- permutation flowshop
- bicriteria
- flowshop scheduling problems
- number of tardy jobs
- job processing times
- production system
- special case
- completion times
- multi objective
- identical parallel machines
- robotic cell
- single machine scheduling problem
- dispatching rule
- lower bound
- objective function
- strongly np hard