Schedule execution for two-machine flow-shop with interval processing times.
Natalja M. MatsveichukYuri N. SotskovNatalja G. EgorovaTsung-Chyan LaiPublished in: Math. Comput. Model. (2009)
Keyphrases
- processing times
- scheduling problem
- scheduling decisions
- single machine scheduling problem
- single machine
- resource consumption
- flowshop
- setup times
- earliness tardiness
- scheduling jobs
- total weighted tardiness
- polynomially solvable
- release dates
- precedence relations
- identical machines
- worst case performance ratio
- job shop scheduling problem
- assembly line
- completion times
- precedence constraints
- tabu search
- release times
- np hard
- job shop
- competitive ratio
- search space