A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times
The lot-sizing and scheduling problem with multiple constraints is formulated. The primal problem is decomposed into simple subproblems by Lagrangian decomposition. A hybrid Lagrangian-simulated annealing-based heuristic is proposed. It outperforms other heuristic methods and meets practical requirement of the tested firm.
capacitated lot-sizing and scheduling sequence-dependent setup unrelated parallel machines lagrangian relaxation simulated annealing