A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups.
Jeffrey B. SidneyChris N. PottsChelliah SriskandarajahPublished in: Oper. Res. Lett. (2000)
Keyphrases
- scheduling problem
- iterative repair
- list scheduling
- unrelated parallel machines
- rolling horizon
- flowshop
- flowshop scheduling
- job shop scheduling problem
- critical path
- optimal solution
- tabu search
- resource constraints
- scheduling jobs
- scheduling policies
- combinatorial optimization
- simulated annealing
- scheduling algorithm
- data sets
- parallel machines
- round robin
- heuristic methods
- dynamic scheduling
- earth observing
- packing problem
- resource allocation
- strongly np hard
- agent architecture
- dynamic programming
- np hard