An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs.
Hatem HaddaNajoua DridiSonia Hajri-GaboujPublished in: 4OR (2010)
Keyphrases
- shortest processing time
- single machine
- minimize total
- asymptotic optimality
- scheduling problem
- processing times
- scheduling jobs
- worst case performance ratio
- preventive maintenance
- parallel machine scheduling problem
- flowshop
- strongly np hard
- parallel machines
- asymptotically optimal
- release dates
- branch and bound algorithm
- unrelated parallel machines
- list scheduling
- optimal solution
- single machine scheduling problem
- database systems
- total cost
- approximation algorithms
- sufficient conditions
- response time
- dynamic programming