12
Views
13
CrossRef citations to date
0
Altmetric
Theoretical Paper

Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs

, &
Pages 1759-1766 | Received 01 Sep 2007, Accepted 01 Sep 2008, Published online: 21 Dec 2017

References

  • AlidaeeBWomerNKScheduling with time dependent processing times: Review and extensionsJ Opl Res Soc19995071172010.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
  • BrowneSYechialiUScheduling deteriorating jobs on a single processorOpns Res19903849549810.1287/opre.38.3.495
  • ChengTCEDingQThe complexity of single machine scheduling with release timesInform Process Lett199865757910.1016/S0020-0190(97)00195-6
  • ChengTCEDingQSingle machine scheduling with step-deteriorating processing timesEur J Opl Res200113462363010.1016/S0377-2217(00)00284-8
  • ChengTCEDingQScheduling start time dependent tasks with deadlines and identical initial processing times on a single machineComput Opns Res200330516210.1016/S0305-0548(01)00077-6
  • ChengTCEDingQKovalyovMYBachmanAJaniakAScheduling jobs with piecewise linear decreasing processing timesNav Res Logist20035053155410.1002/nav.10073
  • ChengTCEDingQLinBMTA concise survey of scheduling with time-dependent processing timesEur J Opl Res200415211310.1016/S0377-2217(02)00909-8
  • FrenchSSequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop1982
  • GuoAXWangJBSingle machine scheduling with deteriorating jobs under the group technology assumptionInt J Pure Appl Math200518225231
  • GuptaJNDGuptaSKSingle facility scheduling with nonlinear processing timesComput Ind Eng19881438739310.1016/0360-8352(88)90041-1
  • GuptaSKKunnathurASDandapaniKOptimal repayment policies for multiple loansOmega19871532333010.1016/0305-0483(87)90020-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
  • 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 Ind Eng19952886987910.1016/0360-8352(95)00006-M
  • NgCTChengTCEBachmanAJaniakAThree scheduling problems with deteriorating jobs to minimize the total completion timeInform Process Lett20028132733310.1016/S0020-0190(01)00244-7
  • SundararaghavanPSKunnathurASingle machine scheduling with start time dependent processing time: Some solvable casesEur J Opl Res19947839440310.1016/0377-2217(94)90048-5
  • WangJBXiaZQFlow shop scheduling with deteriorating jobs under dominating machinesOmega20063432733610.1016/j.omega.2004.10.006
  • WangJBNgCTChengTCELiuLLMinimizing total completion time in a two-machine flow shop with deteriorating jobsAppl Math Comput2006180185193

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.