An Adapted Variable Neighborhood Search based algorithm for the cyclic multi-hoist design and scheduling problem.
Emna LaajiliSid LamrousMarie-Ange ManierJean-Marc NicodPublished in: Comput. Ind. Eng. (2021)
Keyphrases
- np hard
- scheduling problem
- optimal solution
- cost function
- dynamic programming
- worst case
- objective function
- optimization algorithm
- tabu search
- benchmark problems
- simulated annealing
- minimum spanning tree
- search procedure
- variable neighborhood search
- path relinking
- heuristic methods
- approximation algorithms
- single machine
- feasible solution
- convex hull
- combinatorial optimization