An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns.
David AlcaideA. Rodriguez-GonzalezJoaquin SiciliaPublished in: Eur. J. Oper. Res. (2002)
Keyphrases
- flowshop
- scheduling problem
- lot streaming
- strongly np hard
- special case
- setup times
- processing times
- flowshop scheduling
- permutation flowshop
- sequence dependent setup times
- flowshop scheduling problems
- open shop
- bicriteria
- single machine
- maximum lateness
- total flowtime
- unrelated parallel machines
- minimizing makespan
- multistage
- tabu search
- makespan minimization
- asymptotic optimality
- total weighted tardiness
- precedence constraints
- harmony search algorithm
- job shop
- parallel machines
- approximation algorithms
- neural network
- batch processing
- dynamic programming
- genetic algorithm