On non-permutation solutions to some two machine flow shop scheduling problems.
Vitaly A. StrusevichCarin M. ZwaneveldPublished in: Math. Methods Oper. Res. (1994)
Keyphrases
- scheduling problem
- processing times
- single machine
- np hard
- flowshop
- squeaky wheel
- job shop scheduling
- parallel machines
- tabu search
- optimal solution
- job shop scheduling problem
- special case
- greedy heuristics
- limited capacity
- setup times
- similar problems
- database
- earliness tardiness
- job shop
- precedence constraints
- lower bound
- learning algorithm
- computational complexity
- benchmark problems
- solution space
- linear programming