An effective heuristic for the CLSP with set-up times

DOI10.1057/palgrave.jors.2601525zbMath1070.90036OpenAlexW2018769216MaRDI QIDQ4679626

Christoforos Charalambous, Khalil S. Hindi, Krzysztof Fleszar

Publication date: 21 June 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601525

zbMATH Keywords

productionplanningsearchnetworks and graphssmoothing heuristic

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Deterministic network models in operations research (90B10)

Related Items (21)

Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times ⋮ Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem ⋮ A hybrid genetic algorithm and variable neighborhood search for multi-family capacitated lot-sizing problem ⋮ The profit maximizing capacitated lot-size (PCLSP) problem ⋮ A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines ⋮ A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Modeling industrial lot sizing problems: a review ⋮ A coupling cutting stock-lot sizing problem in the paper industry ⋮ A capacitated lot sizing problem with stochastic setup times and overtime ⋮ A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm ⋮ Variable neighbourhood search: methods and applications ⋮ Single machine multi-product capacitated lot sizing with sequence-dependent setups ⋮ Multi-item capacitated lot-sizing problems with setup times and pricing decisions ⋮ Modeling of period overlapping setup times ⋮ SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM ⋮ Variable neighbourhood search: Methods and applications ⋮ A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems

This page was built for publication: An effective heuristic for the CLSP with set-up times