Two-Machine Flow-Shop Minimum-Length Scheduling with Interval Processing Times.
C. T. NgNatalja M. MatsveichukYuri N. SotskovT. C. Edwin ChengPublished in: Asia Pac. J. Oper. Res. (2009)
Keyphrases
- processing times
- minimum length
- scheduling problem
- scheduling jobs
- identical machines
- release dates
- precedence relations
- single machine
- identical parallel machines
- setup times
- release times
- flowshop
- shortest path
- resource consumption
- communication delays
- single machine scheduling problem
- job processing times
- scheduling decisions
- digital curves
- sequence dependent setup times
- manufacturing cell
- tabu search
- np hard
- worst case performance ratio
- precedence constraints
- parallel machines
- job shop
- completion times
- competitive ratio
- scheduling algorithm
- shortest path problem
- resource allocation
- gray scale
- image analysis