40
Views
43
CrossRef citations to date
0
Altmetric
General Paper

Worst-case analysis for flow shop scheduling problems with an exponential learning effect

&
Pages 130-137 | Received 01 Jul 2009, Accepted 01 Feb 2011, Published online: 21 Dec 2017

References

  • BachmanAJaniakAScheduling jobs with position-dependent processing timesJ Opl Res Soc20045525726410.1057/palgrave.jors.2601689
  • BadiruABComputational survey of univariate and multivariate learning curve modelsIEEE T Eng Manage19923917618810.1109/17.141275
  • 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
  • ChengTCEWangGSingle machine scheduling with learning effect considerationsAnn Opns Res20009827329010.1023/A:1019216726076
  • ChengTCEWuCCLeeWCSome scheduling problems with sum-of-processing-times-based and job-position-based learning effectsInform Sciences20081782476248710.1016/j.ins.2008.02.002
  • ChengTCEWuCCLeeWCSome scheduling problems with deteriorating jobs and learning effectsComput Ind Eng20085497298210.1016/j.cie.2007.11.006
  • ErenTA bicriteria parallel machine scheduling with a learning effect of setup and removal timesAppl Math Model2009331141115010.1016/j.apm.2008.01.010
  • ErenTGünerEA bicriteria scheduling problem with a learning effect: Total completion time and total tardinessINFOR: Inform Syst Opl Res2007457581
  • ErenTGünerEMinimizing total tardiness in a scheduling problem with a learning effectAppl Math Model2007311351136110.1016/j.apm.2006.03.030
  • GareyMRJohnsonDSComputers and Intractability: A Guided Tour to the Theory of NP-Completeness1979
  • GonzalezTSahniSFlowshop and jobshop schedules: Complexity and approximationOpns Res197826365210.1287/opre.26.1.36
  • GrahamRLLawlerELLenstraJKRinnooy KanAHGOptimization and approximation in deterministic sequencing and scheduling: A surveyAnn Discrete Math1979528732610.1016/S0167-5060(08)70356-X
  • HoogeveenJAKawaguchiTMinimizing total completion time in a two-machine flowshop: Analysis of special casesMath Opns Res19992488791010.1287/moor.24.4.887
  • JaniakAJaniakWRudekRWielgusASolution algorithms for the makespan minimization problem with the general learning modelComput Ind Eng2009561301130810.1016/j.cie.2008.07.019
  • JohnsonSMOptimal two-and-three-stage production schedules with setup times includedNav Res Log19541616810.1002/nav.3800010110
  • KoulamasCKyparisisGJAlgorithms with performance guarantees for flow shops with regular objective functionsIIE Trans2005371107111110.1080/07408170500288067
  • KoulamasCKyparisisGJSingle-machine and two-machine flowshop scheduling with general learning functionsEur J Opl Res200717840240710.1016/j.ejor.2006.01.030
  • LeeW-CWuC-CMinimizing total completion time in a two-machine flowshop with a learning effectInt J Prod Econ200488859310.1016/S0925-5273(03)00179-8
  • LeeW-CWuC-CSungH-JA bi-criterion single-machine scheduling problem with learning considerationsActa Inform20044030331510.1007/s00236-003-0132-9
  • MosheiovGScheduling problems with a learning effectEur J Opl Res200113268769310.1016/S0377-2217(00)00175-2
  • MosheiovGParallel machine scheduling with a learning effectJ Opl Res Soc2001521165116910.1057/palgrave.jors.2601215
  • MosheiovGSidneyJBScheduling with general job-dependent learning curvesEur J Opl Res200314766567010.1016/S0377-2217(02)00358-2
  • MosheiovGSidneyJBNote on scheduling with general learning curves to minimize the number of tardy jobsJ Opl Res Soc20055611011210.1057/palgrave.jors.2601809
  • PinedoMScheduling: Theory, Algorithms and Systems2002
  • SmithWEVarious optimizers for single-stage productionNav Res Log19563596610.1002/nav.3800030106
  • SmutnickiCSome results of worst-case analysis for flow shop schedulingEur J Opl Res1998109668710.1016/S0377-2217(97)00139-2
  • TownsendWThe single machine problem with quadratic penalty function of completion times: A branch-and-bound solutionMngt Sci19782453053410.1287/mnsc.24.5.530
  • WangJ-BFlow shop scheduling jobs with position-dependent processing timesJ Appl Math Comput20051838339110.1007/BF02936581
  • WangJ-BNgCTChengTCELiuLLSingle-machine scheduling with a time-dependent learning effectInt J Prod Econ200811180281110.1016/j.ijpe.2007.03.013
  • WangJ-BXiaZ-QFlow shop scheduling with a learning effectJ Opl Res Soc2005561325133010.1057/palgrave.jors.2601856
  • WrightTPFactors affecting the cost of airplanesJ Aeronaut Sci1936312212810.2514/8.155
  • WuCCLeeWCSingle-machine scheduling problems with a learning effectAppl Math Model2008321191119710.1016/j.apm.2007.03.001
  • XuZSunLGongJWorst-case analysis for flow shop scheduling with a learning effectInt J Prod Econ200811374875310.1016/j.ijpe.2007.11.002

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.