Approximating Two-Machine Flow Shop Problem with Delays When Processing Times Depend Only on Machines.
Alexander A. AgeevAlexei E. BaburinPublished in: DOOR (Supplement) (2016)
Keyphrases
- processing times
- identical machines
- flowshop
- scheduling problem
- single machine
- identical parallel machines
- communication delays
- setup times
- scheduling jobs
- release dates
- makespan minimization
- single machine scheduling problem
- manufacturing cell
- total weighted tardiness
- worst case performance ratio
- special case
- parallel machines
- scheduling decisions
- precedence relations
- earliness tardiness
- sequence dependent setup times
- polynomially solvable
- competitive ratio
- release times
- tabu search
- assembly line
- resource consumption