76
Views
37
CrossRef citations to date
0
Altmetric
General Paper

Scheduling controllable processing time jobs in a deteriorating environment

Pages 49-56 | Received 01 Sep 2011, Accepted 01 Jan 2013, Published online: 21 Dec 2017

References

  • AlidaeeBAhmadianATwo parallel machine sequencing problems involving controllable job processing timesEuropean Journal of Operational Research199370333534110.1016/0377-2217(93)90245-I
  • BrowneSYechialiUScheduling deteriorating jobs on a single processorOperations Research199038349549810.1287/opre.38.3.495
  • ChengTCEDingQLinBMTA concise survey of scheduling with time-dependent processing timesEuropean Journal of Operational Research2004152111310.1016/S0377-2217(02)00909-8
  • GuptaJNDGuptaSKSingle facility scheduling with nonlinear processing timesComputers & Industrial Engineering198814438739310.1016/0360-8352(88)90041-1
  • GuptaSKKunnathurASDandanpaniKOptimal repayment policies for multiple loansOmega198715432333010.1016/0305-0483(87)90020-X
  • JaniakAMinimization of blooming mills standstills—Mathematical model, suboptimal algorithmsMechanika1989823749
  • JaniakAKovalyovMYSingle machine scheduling subject to deadlines and resource dependent processing timesEuropean Journal of Operational Research199694228429110.1016/0377-2217(96)00129-4
  • KaspiMShabtayDOptimization of machining economics problem for a multi-stage transfer machine under failure, opportunistic and integrated replacement strategiesInternational Journal of Production Research200341102229224810.1080/0020754031000087175
  • KuoW-HYangD-LA note on due-date assignment and single-machine scheduling with deteriorating jobsJournal of the Operational Research Society200859685785910.1057/palgrave.jors.2602396
  • KuoW-HYangD-LA note on due-date assignment and single-machine scheduling with deteriorating jobs and learning effectsJournal of the Operational Research Society201162120621010.1057/jors.2009.155
  • LeeCYLeiLMultiple-project scheduling with controllable project duration and hard resource constraint: Some solvable casesAnnals of Operations Research20011021–428730710.1023/A:1010918518726
  • MonmaCLSchrijverAToddMJWeiVKConvex resource allocation problems on directed acyclic graphs: Duality, complexity, special cases and extensionsMathematics of Operations Research199015473674810.1287/moor.15.4.736
  • MosheiovGV-shaped policies for scheduling deteriorating jobsOperations Research199239697999110.1287/opre.39.6.979
  • NgCTCaiXChengTCELamSSMinimizing completion time variance with compressible processing timesJournal of Global Optimization200531233335210.1007/s10898-004-5703-y
  • ShabtayDSingle and two-resource allocation algorithms for minimizing the maximal lateness in a single machineComputers and Operations Research20043181303131510.1016/S0305-0548(03)00081-9
  • ShabtayDSteinerGA survery of scheduling with controllable processing timesDiscrete Applied Mathematics2007155131643166610.1016/j.dam.2007.02.003
  • ShakhlevichNVStrusevichVASingle machine scheduling with controllable release and processing parametersDiscrete Applied Mathematics2006154152178219910.1016/j.dam.2005.04.014
  • SunL-HSunL-YWangJ-BSingle-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobsJournal of the Operational Research Society201162476877510.1057/jors.2010.26
  • VicksonRGTwo single machine sequencing problems involving controllable job processing timesAIIE Transactions198012325826210.1080/05695558008974515

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.