32
Views
14
CrossRef citations to date
0
Altmetric
Theoretical Paper

Beam search heuristics for quadratic earliness and tardiness scheduling

Pages 620-631 | Received 01 Oct 2007, Accepted 01 Dec 2008, Published online: 21 Dec 2017

References

  • Abdul-RazaqTPottsCNDynamic programming state-space relaxation for single machine schedulingJ Opl Res Soc19883914115210.1057/jors.1988.26
  • BakerKRScudderGDSequencing with earliness and tardiness penalties: A reviewOpns Res199038223610.1287/opre.38.1.22
  • Della CroceFT'kindtVA recovering beam search algorithm for the one-machine dynamic total completion time scheduling problemJ Opl Res Soc2002531275128010.1057/palgrave.jors.2601389
  • Della CroceFGhirardiMTadeiRRecovering beam search: Enhancing the beam search approach for combinatorial optimization problemsJ Heuristics2004108910410.1023/B:HEUR.0000019987.10818.e0
  • EsteveBAubijouxCChartierAT'kindtVA recovering beam search algorithm for the single machine just-in-time scheduling problemEur J Opl Res200617279881310.1016/j.ejor.2004.11.014
  • GhirardiMPottsCNMakespan minimization for scheduling unrelated parallel machines: A recovering beam search approachEur J Opl Res200516545746710.1016/j.ejor.2004.04.015
  • GuptaSKSenTMinimizing a quadratic function of job lateness on a single machineEng Costs Prod Econ1983718719410.1016/0167-188X(83)90012-5
  • HoogeveenHMulticriteria schedulingEur J Opl Res200516759262310.1016/j.ejor.2004.07.011
  • KanetJJSridharanVScheduling with inserted idle time: Problem taxonomy and literature reviewOpns Res2000489911010.1287/opre.48.1.99.12447
  • Korman K (1994). A pressing matter. Video February: pp 46–50.
  • Landis K (1993). Group technology and cellular manufacturing in the Westvaco Los Angeles VH department. Project Report in IOM 581, School of Business, University of Southern California.
  • LiGSingle machine earliness and tardiness schedulingEur J Opl Res19979654655810.1016/S0377-2217(96)00062-8
  • LiawCFA branch-and-bound algorithm for the single machine earliness and tardiness scheduling problemComput Opns Res19992667969310.1016/S0305-0548(98)00081-1
  • Lowerre BT (1976). The HARPY speech recognition system. PhD thesis, Carnegie-Mellon University, USA.
  • OwPSMortonTEFiltered beam search in schedulingInt J Prod Res198826356210.1080/00207548808947840
  • OwPSMortonTEThe single machine early/tardy problemMngt Sci19893517719110.1287/mnsc.35.2.177
  • Rubin S (1978). The ARGOS image understanding system. PhD thesis, Carnegie-Mellon University, USA.
  • SchallerJMinimizing the sum of squares lateness on a single machineEur J Opl Res2002143647910.1016/S0377-2217(01)00322-8
  • SchallerJSingle machine scheduling with early and quadratic tardy penaltiesComput Ind Eng20044651153210.1016/j.cie.2004.01.011
  • SenTDileepanPLindMRMinimizing a weighted quadratic function of job lateness in the single machine systemInt J Prod Econ19954223724310.1016/0925-5273(95)00201-4
  • SuLHChangPCA heuristic to minimize a quadratic function of job lateness on a single machineInt J Prod Econ19985516917510.1016/S0925-5273(98)00041-3
  • Valente JMS (2007a). An exact approach for single machine scheduling with quadratic earliness and tardiness penalties. Working Paper 238, Faculdade de Economia, Universidade do Porto, Portugal.
  • ValenteJMSHeuristics for the single machine scheduling problem with early and quadratic tardy penaltiesEur J Ind Eng2007143144810.1504/EJIE.2007.015391
  • ValenteJMSAlvesRAFSFiltered and recovering beam search algorithms for the early/tardy scheduling problem with no idle timeComput Ind Eng20054836337510.1016/j.cie.2005.01.020
  • ValenteJMSAlvesRAFSImproved heuristics for the early/tardy scheduling problem with no idle timeComput Opns Res20053255756910.1016/j.cor.2003.08.003
  • ValenteJMSAlvesRAFSImproved lower bounds for the early/tardy scheduling problem with no idle timeJ Opl Res Soc20055660461210.1057/palgrave.jors.2601865
  • ValenteJMSAlvesRAFSHeuristics for the single machine scheduling problem with quadratic earliness and tardiness penaltiesComp Opns Res2008353696371310.1016/j.cor.2007.04.006

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:

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:

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.