Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation.
Jose M. FramiñanRainer LeistenRafael Ruiz-UsanoPublished in: Eur. J. Oper. Res. (2002)
Keyphrases
- flowshop
- scheduling problem
- flowshop scheduling problems
- flowshop scheduling
- processing times
- minimizing makespan
- special case
- makespan minimization
- tabu search
- setup times
- single machine
- sequence dependent setup times
- bicriteria
- total tardiness
- strongly np hard
- total flowtime
- maximum lateness
- np hard
- permutation flowshop
- parallel machines
- maximum tardiness
- search algorithm
- preventive maintenance
- total weighted tardiness
- precedence constraints
- heuristic methods
- unrelated parallel machines
- multiple objectives
- lot streaming
- release dates
- np complete