Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems.
Philippe BaptisteClaude Le PapeWim NuijtenPublished in: Ann. Oper. Res. (1999)
Keyphrases
- scheduling problem
- flowshop
- processing times
- np hard
- upper bound
- job shop scheduling
- job shop scheduling problem
- lower bound
- setup times
- satisfiability problem
- single machine
- precedence constraints
- worst case
- job shop
- sequencing problems
- earliness tardiness
- propositional logic
- tabu search
- np complete
- distribution free
- greedy heuristics
- phase transition
- neural network
- logic programs