A heuristic approach for a scheduling problem in additive manufacturing under technological constraints.
Aymen AlouiKhaled Hadj-HamouPublished in: Comput. Ind. Eng. (2021)
Keyphrases
- scheduling problem
- tabu search
- precedence constraints
- np hard
- constraint satisfaction
- job shop scheduling problem
- strongly np hard
- flowshop
- multi depot
- single machine
- list scheduling
- unrelated parallel machines
- constraint violations
- minimizing makespan
- manufacturing systems
- quay crane
- mixed integer program
- randomly generated test problems
- quality control
- feasible solution
- lagrangian relaxation
- global constraints
- search procedure
- sequence dependent setup times
- maximum lateness
- processing times
- approximation algorithms
- constraint programming
- optimization problems
- simulated annealing
- computational complexity