Anchored reactive and proactive solutions to the CPM-scheduling problem.
Pascale BendottiPhilippe ChrétiennePierre FouilhouxAlain QuilliotPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- scheduling problem
- np hard
- tabu search
- single machine
- flowshop
- information systems
- benchmark problems
- randomly generated test problems
- earliness tardiness
- permutation flowshop
- efficient solutions
- lower bound
- manufacturing systems
- processing times
- job shop scheduling problem
- feasible solution
- setup times
- context aware
- special case