A re-entrant flowshop heuristic for online scheduling of the paper path in a large scale printer.
Umar WaqasMarc GeilenJack KandelaarsLou J. SomersTwan BastenSander StuijkPatrick VestjensHenk CorporaalPublished in: DATE (2015)
Keyphrases
- flowshop
- scheduling problem
- unrelated parallel machines
- tabu search
- maximum tardiness
- setup times
- sequence dependent setup times
- number of tardy jobs
- strongly np hard
- parallel machines
- maximum lateness
- preventive maintenance
- job shop scheduling problem
- processing times
- minimizing total tardiness
- minimizing makespan
- bicriteria
- flowshop scheduling
- job shop
- np hard
- single machine
- precedence constraints
- total tardiness
- online learning
- special case
- flowshop scheduling problems
- release dates
- job processing times
- identical parallel machines
- permutation flowshop
- heuristic methods
- search procedure
- multi objective
- optimal solution
- scheduling algorithm
- shortest path
- neural network
- greedy algorithm
- metaheuristic
- particle swarm optimization
- search algorithm