94
Views
20
CrossRef citations to date
0
Altmetric
Theoretical Paper

Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria

&
Pages 152-164 | Received 01 May 2008, Accepted 01 Sep 2009, Published online: 21 Dec 2017

References

  • AbumaizarRJSvestkaJARescheduling job shops under random disruptionsInt J Prod Res1997352065208210.1080/002075497195074
  • AggarwalVA Lagrangean-relaxation method for the constrained assignment problemComput Opns Res1985129710610.1016/0305-0548(85)90011-5
  • AktürkMSGörgülüEMatch-up scheduling under a machine breakdownEur J Opl Res1999112819710.1016/S0377-2217(97)00396-2
  • AlagözOAzizoğluMRescheduling of identical parallel machines under machine eligibility constraintsEur J Opl Res200314952353210.1016/S0377-2217(02)00499-X
  • AytugHLawleyMAMcKayKMohanSUzsoyRExecuting production schedules in the face of uncertainties: A review and some future directionsEur J Opl Res20051618611010.1016/j.ejor.2003.08.027
  • AzizoğluMAlagözOParallel machine rescheduling with machine disruptionsIIE Trans2005371113111810.1080/07408170500288133
  • BeanJCBirgeJRMittenthalJNoonCEMatchup scheduling with multiple resources, release dates and disruptionsOpns Res19913947048310.1287/opre.39.3.470
  • ChurchLKUzsoyRAnalysis of periodic and event-driven rescheduling policies in dynamic shopsInt J Comp Integ M1992515316310.1080/09511929208944524
  • ClausenJHansenJLarsenJLarsenADisruption managementORMS Today2001284043
  • CurryJPetersBRescheduling parallel machines with stepwise increasing tardiness and machine assignment stability objectivesInt J Prod Res2005433231324610.1080/00207540500103953
  • DanielsRLKouvelisPRobust scheduling to hedge against processing time uncertainty in single stage productionMngt Sci19954136337610.1287/mnsc.41.2.363
  • HallNGPottsCNRescheduling for new ordersOpns Res20045244045310.1287/opre.1030.0101
  • Kaspi M and Montreuil B (1988). On the scheduling of identical parallel processes with arbitrary initial processor available time. Research Report 88–12, School of Industrial Engineering, Purdue University.
  • KondakciSAzizoğluMKoksalanMNote: Bicriteria scheduling for minimizing flow time and maximum tardinessNav Res Log19964392993610.1002/(SICI)1520-6750(199609)43:6<929::AID-NAV9>3.0.CO;2-6
  • Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (1989). Sequencing and scheduling: algorithms and complexity. Reports BS-R8909, Centre for Mathematics and Computers Science, Amsterdam.
  • LeeCYMachine scheduling with an availability constraintJ Glob Opin1996939541610.1007/BF00121681
  • LeeCYChenZLScheduling jobs and maintenance activities on parallel machinesNav Res Log20004792993610.1002/(SICI)1520-6750(200003)47:2<145::AID-NAV5>3.0.CO;2-3
  • LeeCYLimanSDSingle-machine flow-time scheduling with scheduled maintenanceActa Inform19922937538210.1007/BF01178778
  • LeungJY-TPinedoMA note on scheduling parallel machines subject to breakdown and repairNav Res Log200451607110.1002/nav.10105
  • LiEShawWFlow-time performance of modified-scheduling heuristics in a dynamic rescheduling environmentComput Ind Eng19963121321610.1016/0360-8352(96)00114-3
  • LimAXuZSearching optimal resequencing and feature assignment on an automated assembly lineJ Opl Res Soc20096036137110.1057/palgrave.jors.2602533
  • LogendranRSuburFUnrelated parallel machine scheduling with job splittingIIE Trans20043635937210.1080/07408170490279598
  • Logendran R, McDonell B, Smucker B (2007). Scheduling unrelated parallel machines with sequence-dependent set-ups. Comput Opns Res 34: 3420–3438.
  • MasonSJJinSWesselsCMRescheduling strategies for minimizing total weighted tardiness in complex job shopsInt J Prod Res20044261362810.1081/00207540310001614132
  • MosheiovGMinimizing the sum of job completion times on capacitated parallel machinesMath Comp Mod199420919910.1016/0895-7177(94)90024-8
  • O'DonovanRUzsoyRMcKayKNPredictable scheduling of a single machine with breakdowns and sensitive jobsInt J Prod Res1999184217423310.1080/002075499189745
  • OlumoladeMONorrieDHReactive scheduling system for cellular manufacturing with failure-prone machinesInt J Comput Integ M1996913114410.1080/095119296131742
  • Ozlen M and Azizoğlu M (2009). Generating all efficient solutions of a rescheduling problem on unrelated parallel machines. Int J Prod Res 47: 5245–5270.
  • QiXTBardJRYuGDisruption management for machine scheduling: the case of SPT schedulesInt J Prod Econ200610316618410.1016/j.ijpe.2005.05.021
  • RahejaASSubramaniamVReactive recovery of job shop schedules—A reviewInt J Adv Man Tech20021975676310.1007/s001700200087
  • SureshVChaudhuriDScheduling of unrelated parallel machines when machine availability is specifiedProd Plan Control1996739340010.1080/09537289608930367
  • ÜnalATUzsoyRKiranASRescheduling on a single machine with part-type dependent setup times and deadlinesAnn Oper Res1997709311310.1023/A:1018955111939
  • VieiraGEHerrmannJWEdwardLRescheduling manufacturing systems: A framework of strategies, policies and methodsJ Sched20036396210.1023/A:1022235519958
  • WuSDStorerRHChangPCOne-machine rescheduling heuristics with efficiency and stability as criteriaComput Opns Res19932011410.1016/0305-0548(93)90091-V
  • YaghubianARHodgsonTJJoinesJACulbrethCTHuangJCDry kiln scheduling in furniture productionIIE Trans199931733738

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.