A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags.
Yoshiyuki KarunoHiroshi NagamochiPublished in: ISAAC (2003)
Keyphrases
- flowshop
- scheduling problem
- minimizing total tardiness
- sequence dependent setup times
- processing times
- bicriteria
- flowshop scheduling
- single machine
- setup times
- np hard
- minimizing makespan
- special case
- total tardiness
- makespan minimization
- maximum lateness
- tabu search
- robotic cell
- total flowtime
- total weighted tardiness
- strongly np hard
- precedence constraints
- parallel machines
- permutation flowshop
- approximation algorithms
- flowshop scheduling problems
- unrelated parallel machines
- job processing times
- preventive maintenance
- completion times
- metaheuristic
- maximum tardiness
- error bounds
- ant colony optimization