On two-machine Flow Shop Scheduling Problem with disjoint setups.
Andrzej GnatowskiJaroslaw RudyRadoslaw IdzikowskiPublished in: SoSE (2020)
Keyphrases
- scheduling problem
- single machine
- processing times
- flowshop
- np hard
- setup times
- tabu search
- permutation flowshop
- pairwise
- precedence constraints
- minimizing makespan
- limited capacity
- parallel machines
- quay crane
- earliness tardiness
- total tardiness
- job shop scheduling problem
- decision trees
- release dates
- sequence dependent setup times
- maximum lateness
- dynamic programming
- expert systems
- search algorithm
- clustering algorithm