41
Views
17
CrossRef citations to date
0
Altmetric
Technical Note

A note on due-date assignment and single-machine scheduling with deteriorating jobs and learning effects

&
Pages 206-210 | Received 01 Dec 2008, Accepted 01 Sep 2009, Published online: 21 Dec 2017

References

  • AlidaeeBWomerNKScheduling with time dependent processing times: Review and extensionsOpl Res Soc19995071172910.1057/palgrave.jors.2600740
  • BachmanAJaniakAMinimizing maximum lateness under linear deteriorationEur J Opl Res200012655756610.1016/S0377-2217(99)00310-0
  • BachmanAJaniakAKovalyovMYMinimizing the total weighted completion time of deteriorating jobsInform Process Lett200281818410.1016/S0020-0190(01)00196-X
  • BiskupDSingle-machine scheduling with learning considerationsEur J Opl Res199911517317810.1016/S0377-2217(98)00246-X
  • BiskupDA state-of-the-art review on scheduling with learning effectsEur J Opl Res200818831532910.1016/j.ejor.2007.05.040
  • BrowneSYechialiUScheduling deteriorating jobs on a single processorOpns Res19903849549810.1287/opre.38.3.495
  • ChengTCEDingQLinBMTA concise survey of scheduling with time-dependent processing timesEur J Opl Res200415211310.1016/S0377-2217(02)00909-8
  • ChengTCEKangLNgCTDue-date assignment and single machine scheduling with deteriorating jobsOpl Res Soc20045519820310.1057/palgrave.jors.2601681
  • ChengTCEWuCCLeeWCSome scheduling problems with deteriorating jobs and learning effectsComput Ind Eng20085497298210.1016/j.cie.2007.11.006
  • GordonVProthJMChuCA survey of the state-of-the-art of common due date assignment and scheduling researchEur J Opl Res200213512510.1016/S0377-2217(01)00181-3
  • GrahamRLLawlerELLenstraJKRinnooy KanAHGOptimization and approximation in deterministic sequencing and scheduling: A surveyAnn Discrete Math1979528732610.1016/S0167-5060(08)70356-X
  • KunnathurASGuptaSKMinimizing the makespan with late start penalties added to processing times in a single facility scheduling problemEur J Opl Res199047566410.1016/0377-2217(90)90089-T
  • KuoWHYangDLSingle-machine group scheduling with a time-dependent learning effectComput Opns Res2006332099211210.1016/j.cor.2004.11.024
  • KuoWHYangDLMinimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effectEur J Opl Res20061741184119010.1016/j.ejor.2005.03.020
  • LeeWCA note on deteriorating jobs and learning in single-machine scheduling problemsInt J Bus Econ200438389
  • MosheiovGV-shaped policies for scheduling deteriorating jobsOpns Res19913997999110.1287/opre.39.6.979
  • MosheiovGScheduling jobs under simple linear deteriorationComput Opns Res19942165365910.1016/0305-0548(94)90080-9
  • MosheiovGScheduling jobs with step-deterioration: Minimizing makespan on a single- and multi-machineComput Indust Eng19952886987910.1016/0360-8352(95)00006-M
  • MosheiovGΛ-shaped policies for schedule deteriorating jobsOpl Res Soc1996471184119110.1057/jors.1996.146
  • MosheiovGScheduling problems with a learning effectEur J Opl Res200113268769310.1016/S0377-2217(00)00175-2
  • MosheiovGSidneyJBScheduling with general job-dependent learning curvesEur J Opl Res200314766567010.1016/S0377-2217(02)00358-2
  • PanwalkarSSSmithMLSeidmannACommon due date assignment to minimize total penalty for the one machine scheduling problemOpns Res19823039139910.1287/opre.30.2.391
  • WangJBSingle-machine scheduling problems with the effects of learning and deteriorationOmega20073539740210.1016/j.omega.2005.07.008
  • WangJBChengTCEScheduling problems with the effects of deterioration and learningAsia Pac J Opl Res20072424526110.1142/S021759590700122X
  • WangXChengTCESingle-machine scheduling with deteriorating jobs and learning effects to minimize the makespanEur J Opl Res2007178577010.1016/j.ejor.2006.01.017

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.