A Heuristic for Variable Re-Entrant Scheduling Problems.
Roel van der TempelJoost van PinxtenMarc GeilenUmar WaqasPublished in: DSD (2018)
Keyphrases
- scheduling problem
- flowshop
- tabu search
- list scheduling
- sequencing problems
- job shop scheduling problem
- randomly generated test problems
- single machine
- strongly np hard
- quay crane
- parallel machine scheduling problem
- np hard
- processing times
- variable ordering
- minimizing total tardiness
- minimizing makespan
- graph coloring problems
- optimal solution
- squeaky wheel
- job shop scheduling
- search algorithm
- parallel machines
- precedence constraints
- sequence dependent setup times
- job shop
- setup times
- manufacturing systems
- special case
- greedy heuristic
- lagrangian relaxation
- limited capacity
- greedy heuristics
- search strategies
- feasible solution
- dynamic programming
- lower bound
- release dates