Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem.
Lucien MousinMarie-Eléonore KessaciClarisse DhaenensPublished in: CoRR (2019)
Keyphrases
- flowshop
- scheduling problem
- strongly np hard
- processing times
- minimizing makespan
- setup times
- permutation flowshop
- randomly generated test problems
- total tardiness
- single machine
- bicriteria
- sequence dependent setup times
- total flowtime
- flowshop scheduling
- maximum lateness
- special case
- np hard
- parallel machines
- precedence constraints
- tabu search
- unrelated parallel machines
- dispatching rule
- job shop
- preventive maintenance
- flowshop scheduling problems
- identical parallel machines
- minimizing total tardiness
- number of tardy jobs
- job processing times
- total weighted tardiness
- makespan minimization
- maximum tardiness
- open shop
- neural network
- release dates
- multistage
- search space