Advanced search
Publication Cover
Journal of the Operational Research Society Volume 54, 2003 - Issue 5
Submit an article Journal homepage
113
Views
40
CrossRef citations to date
0
Altmetric
Theoretical Paper

An effective heuristic for the CLSP with set-up times

K S HindiAmerican University of Beirut (AUB)BeirutLebanonCorrespondence[email protected]
,
K FleszarWarsaw University of TechnologyWarszawaPoland
&
C CharalambousFrederick Institute of TechnologyNicosiaCyprus
Pages 490-498 | Received 01 Nov 2001, Accepted 01 Oct 2002, Published online: 21 Dec 2017

References

  • BitranGRYanasseHHComputational complexity of the capacitated lot size problemMngt Sci1982281174118610.1287/mnsc.28.10.1174
  • FlorianMLenstraJKRinnooy KanAHGDeterministic production planning: algorithms and complexityMngt Sci19802666967910.1287/mnsc.26.7.669
  • TrigeiroWThomasJMcClainJCapacitated lot sizing with setup timesMngt Sci19893535336610.1287/mnsc.35.3.353
  • MillerAJNemhauserGLSavelsberghWPOn the capacitated lot-sizing and continuous 0–1 knapsack polyhedraEur J Opl Res200012529831510.1016/S0377-2217(99)00461-0
  • BeasleyJELagrangean relaxationModern Heuristic Techniques in Combinatorial Problems1993243303
  • DiabyMBahlHCKarwanMHZiontsSA Lagrangean relaxation approach for very-large-scale capacitated lot-sizingMngt Sci1992381329134010.1287/mnsc.38.9.1329
  • DiabyMBahlHCKarwanMHZiontsSCapacitated lot-sizing and scheduling by Lagrangean relaxationEur J Opl Res19925944445810.1016/0377-2217(92)90201-J
  • BowmanEHProduction scheduling by the transportation method of linear programmingOpns Res19561410010310.1287/opre.4.1.100
  • WagnerMHWhitinTMDynamic version of the economic lot-sizing modelMngt Sci19585899610.1287/mnsc.5.1.89
  • HindiKSComputationally efficient solution of the multi-item, capacitated lot-sizing problemComput Ind Eng19952870971910.1016/0360-8352(95)00021-R
  • AliAPadmanRThiagarajanHDual algorithms for pure network problemsOpns Res19893715817110.1287/opre.37.1.159
  • Hindi KS (1993). Efficient Implementation of Network Simplex Algorithms. DTG Report 93:3 (update of DTG report 87:7), Department of Computation, University of Manchester Institute of Science and Technology (UMIST).
  • GrigoriadisMDAn efficient implementation of the network simplex methodMath Prog Study1986268311110.1007/BFb0121089
  • HindiKSAlgorithms for capacitated, multi-item lot-sizing without setupsJ Opl Res Soc19954646547210.1057/jors.1995.65
  • MladenovićNHansenPVariable neighbourhood searchComputs Opns Res1997241097110010.1016/S0305-0548(97)00031-2
  • HansenPMladenovićNAn introduction to variable neighbourhood searchMetaheuristics, Advances and Trends in Local Search Paradigms for Optimization1999433458

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.