60
Views
11
CrossRef citations to date
0
Altmetric
General Paper

Bi-criteria group scheduling with sequence-dependent setup time in a flow shop

&
Pages 530-546 | Received 01 Sep 2011, Accepted 01 Mar 2012, Published online: 21 Dec 2017

References

  • AllahverdiAA new heuristic for m-machine flowshop-scheduling problem with bicriteria of makespan and maximum tardinessComputer and Operation Research200431215718010.1016/S0305-0548(02)00143-0
  • AllahverdiAGuptaJNDAldowaisanTA review of scheduling research involving setup considerationsOMEGA: The International Journal of Management Sciences199927221923910.1016/S0305-0483(98)00042-5
  • ErenTGünerEA bicriteria scheduling with sequence-dependent setup timesApplied Mathematics and Computation2006179137838510.1016/j.amc.2005.11.112
  • GareyMDJohnsonDSSethiRThe complexity of flowshop and jobshop schedulingMathematics of Operations Research19761211712910.1287/moor.1.2.117
  • GhoshJBGuptaJNDBatch scheduling to minimize maximum latenessOperations Research Letters1997212778010.1016/S0167-6377(97)00028-X
  • HamIHitomiKYoshidaTGroup Technology1985
  • HaririAMAPottsCNA branch and bound algorithm for the two-stage assembly scheduling problemEuropean Journal of Operational Research1997103354755610.1016/S0377-2217(96)00312-8
  • IBM (2009). ILOG CPLEX Optimization Studio 12.2, TX, USA.
  • LiaeeMMEmmonsHScheduling families of jobs with setup timesInternational Journal of Production Economics199751316517610.1016/S0925-5273(96)00105-3
  • LenstraJKRinnoy KanAHGBruckerPComplexity of machine scheduling problemsAnnals of Discrete Mathematics1977343362
  • LogendranRdeSzoekePBarnardFSequence-dependent group scheduling problems in flexible flow shopsInternational Journal of Production Economics20061021668610.1016/j.ijpe.2005.02.006
  • LogendranRSuburFUnrelated parallel machine scheduling with job splittingIIE Transactions200436435937210.1080/07408170490279598
  • MehravaranYLogendranRBi-criteria supply chain scheduling on unrelated-parallel machinesJournal of the Chinese Institute of Industrial Engineers20112829110110.1080/10170669.2010.546165
  • MontgomeryDCDesign and Analysis of Experiments2008
  • Oakdale Engineering (2008). DATAFIT 9.059, PA, USA.
  • Pandya V and Logendran R (2010). Weighted tardiness minimization in flexible flowshops. In: Johnson A and Miller J (eds). Proceedings of the 2010 Industrial EngineeringResearch Conference, Cancún, Mexico.
  • PanwalkerSSDudekRASmithMLTheory of Scheduling and its Application1973
  • PinedoMScheduling: Theory, Algorithms, and Systems2002
  • SalmasiNLogendranRSkandariMRTotal flowtime minimization in a flowshop sequence-dependent group scheduling problemComputers & Operations Research201037119921210.1016/j.cor.2009.04.013
  • SalmasiNLogendranRSkandariRMakespan minimization of a flowshop sequence-dependent group scheduling problemIntemational Journal of Advanced Manufacturing Technology2011565–869971010.1007/s00170-011-3206-9
  • SchallerJEScheduling on a single machine with family setups to minimize total tardinessIntemational Journal of Production Economics.2007105232934410.1016/j.ijpe.2004.10.020
  • SchallerJEGuptaJNDVakhariaAJScheduling a flowline manufacturing cell with sequence dependent family setup timesEuropean Journal of Operational Research2000125232433910.1016/S0377-2217(99)00387-2
  • VaradharajanTKRajendranCA multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobsEuropean Journal of Operational Research2005167377279510.1016/j.ejor.2004.07.020
  • WortmanDBManaging capacity: Getting the most from your firm's assetsIndustrial Engineering19922424749
  • YoonSHLeeISNew constructive heuristics for the total weighted tardiness problemJournal of the Operational Research Society201162123223710.1057/jors.2009.186

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.