A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage.
Yoshiyuki KarunoHiroshi NagamochiPublished in: ISAAC (2002)
Keyphrases
- scheduling problem
- flowshop
- parallel machines
- setup times
- parallel machine scheduling problem
- np hard
- single machine
- manufacturing cell
- processing times
- tabu search
- sequence dependent setup times
- identical parallel machines
- total tardiness
- approximation algorithms
- earliness tardiness
- special case
- minimizing makespan
- identical machines
- permutation flowshop
- precedence constraints
- approximation methods
- relative error
- error bounds
- approximation schemes
- job shop scheduling problem
- unrelated parallel machines
- total weighted tardiness
- preventive maintenance
- neural network
- branch and bound algorithm
- closed form
- visually guided