A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems.
Igor AverbakhOded BermanPublished in: Oper. Res. (1999)
Keyphrases
- flowshop
- scheduling problem
- processing times
- single machine
- sequence dependent setup times
- minimizing makespan
- setup times
- bicriteria
- minimizing total tardiness
- total tardiness
- makespan minimization
- precedence constraints
- special case
- flowshop scheduling
- np hard
- tabu search
- flowshop scheduling problems
- maximum lateness
- asymptotic optimality
- parallel machines
- total weighted tardiness
- unrelated parallel machines
- permutation flowshop
- preventive maintenance
- scheduling jobs
- job shop scheduling
- job shop
- ant colony optimization
- open shop
- strongly np hard
- lot streaming
- shortest path