30
Views
23
CrossRef citations to date
0
Altmetric
Technical Note

Due-date assignment and parallel-machine scheduling with deteriorating jobs

, &
Pages 1103-1108 | Received 01 Oct 2005, Accepted 01 Mar 2006, Published online: 21 Dec 2017

References

  • AlidaeeBAhmadianATwo parallel machine sequencing problems involving controllable job processing timesEur J Opl Res19937033534110.1016/0377-2217(93)90245-I
  • 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
  • BakerKRScudderGDSequencing with earliness and tardiness penalties: a reviewOpns Res199038223610.1287/opre.38.1.22
  • BrowneSYechialiUScheduling deteriorating jobs on a single processorOpns Res19903849549810.1287/opre.38.3.495
  • ChengTCEA heuristic for common due-date assignment and job scheduling on parallel machinesJ Opl Res Soc1989401129113510.1057/jors.1989.194
  • ChengTCEChenZLParallel-machines scheduling problems with earliness and tardiness penaltiesJ Opl Res Soc19944568569510.1057/jors.1994.106
  • ChengTCEDingQSingle machine scheduling with deadlines and increasing rates of processing timesActa Informatica20003667369210.1007/s002360050170
  • ChengTCEChenZLShakhlevichNVCommon due date assignment and scheduling with ready timesComput Opns Res2002291957196710.1016/S0305-0548(01)00067-3
  • ChengTCEKangLYNgCTDue-date assignment and single machine scheduling with deteriorating jobsJ Opl Res Soc20045519820310.1057/palgrave.jors.2601681
  • ChengTCEDingQLinBMTA concise survey of scheduling with time-dependent processing timesEur J Opl Res200415211310.1016/S0377-2217(02)00909-8
  • DePGhoshJBWellsCEDue-date assignment and early/tardy scheduling on identical parallel machinesNaval Res Logist199441173210.1002/1520-6750(199402)41:1<17::AID-NAV3220410103>3.0.CO;2-X
  • EmmonsHScheduling to a common due date on parallel uniform processorsNaval Res Logist Q19873480381010.1002/1520-6750(198712)34:6<803::AID-NAV3220340605>3.0.CO;2-2
  • GordonVSProthJMChuCBA survey of the state-of-the-art of common due date assignment and scheduling researchEur J Opl Res200213912510.1016/S0377-2217(01)00181-3
  • GordonVSProthJMChuCBDue date assignment and scheduling: SLK, TWK and other due date assignment modelsProduct Planning Control20021311713210.1080/09537280110069621
  • GrahamRLLawlerELLenstraJKRinnooy KanAHGOptimization and approximation in deterministic sequencing and scheduling: a surveyAnn Discrete Math1979528732610.1016/S0167-5060(08)70356-X
  • HsiehYCBrickerDLScheduling linearly deteriorating jobs on multiple machinesComput Indust Eng19973272773410.1016/S0360-8352(97)00025-9
  • KubiakWvan de VeldeSLScheduling deteriorating jobs to minimize makespanNaval Res Logist19984551152310.1002/(SICI)1520-6750(199808)45:5<511::AID-NAV5>3.0.CO;2-6
  • 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
  • NgCTChengTCEBachmanAJaniakAThree scheduling problems with deteriorating jobs to minimize the total completion timeInform Process Lett20028132733310.1016/S0020-0190(01)00244-7
  • PanwalkerSSSmithMLSeidmannACommon due date assignment to minimize total penalty for one machine scheduling problemOpns Res19823039139910.1287/opre.30.2.391

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.