Advanced search
Publication Cover
Journal of the Operational Research Society Volume 55, 2004 - Issue 12
Submit an article Journal homepage
627
Views
204
CrossRef citations to date
0
Altmetric
Review

A review and classification of heuristics for permutation flow-shop scheduling with makespan objective

J M FraminanUniversity of SevilleSpainCorrespondence[email protected]
,
J N D GuptaUniversity of Alabaman in HuntsvilleALUSA
&
R LeistenUniversity of Duisburg-Essen in DuisburgGermany
Pages 1243-1255 | Received 01 Aug 2002, Accepted 01 Mar 2004, Published online: 21 Dec 2017

References

  • GrahamRLLawlerELLenstraJKRinnooy KanAHGOptimisation and approximation in deterministic sequencing and scheduling: a surveyAnn Discrete Math1979528732610.1016/S0167-5060(08)70356-X
  • DudekRATeutonOFDevelopment of m stage decision rule for scheduling n jobs through m machinesOpns Res19641247149710.1287/opre.12.3.471
  • SzwarcWElimination methods in the m × n sequencing problemNaval Res Logist19711829530510.1002/nav.3800180302
  • LagewegBJLenstraJKRinnooy KanAHGA general bounding scheme for the permutation flowshop problemOpns Res197826536710.1287/opre.26.1.53
  • PottsCNAn adaptive branching rule for the permutation flowshop problemEur J Opl Res19805192510.1016/0377-2217(80)90069-7
  • CarlierJRebaïITwo branch and bound algorithms for the permutation flowshop problemEur J Opl Res19969023825110.1016/0377-2217(95)00352-5
  • GareyMRJohnsonDSSethiRThe complexity of flowshop and jobshop schedulingMath Opns Res1976111712910.1287/moor.1.2.117
  • Rinnooy KanAHGMachine Scheduling Problems1976
  • GuptaJNDFlowshop scheduling via sorting analogy1971
  • PinedoMScheduling: Theory, Algorithms and Systems1995
  • LourençoHRSevast'yanov's algorithm for the flow-shop scheduling problemEur J Opl Res19969117618910.1016/0377-2217(94)00356-4
  • GuptaJNDA review of flowshop scheduling researchDisaggregation Problems in Manufacturing and Service Operations1979363388
  • KingJRSpachisASHeuristics for flow-shop schedulingInt J Prod Res19801834535710.1080/00207548008919673
  • ParkYBPegdenCDEnscoreEEA survey and evaluation of static flowshop scheduling heuristicInt J Prod Res19842212714110.1080/00207548408942436
  • WidmerMHertzAA new heuristic method for the flow-shop sequencing problemEur J Opl Res19914118619310.1016/0377-2217(89)90383-4
  • MoccellinJVA new heuristic method for the permutation flow-shop scheduling problemJ Opl Res Soc19954688388610.1057/jors.1995.119
  • NawazMEnscoreEEHamIA heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega-Int J Mngt Sci198311919510.1016/0305-0483(83)90088-9
  • PalmerDSSequencing jobs through a multistage process in the minimum total time: a quick method of obtaining a near-optimumOpns Res Quart19651610110710.1057/jors.1965.8
  • CampbellHGDudekRASmithMLA heuristic algorithm for the n-job, m-machine sequencing problemMngt Sci197016B630B63710.1287/mnsc.16.10.B630
  • GuptaJNDA functional heuristic for the flow-shop scheduling problemOpns Res Quart197122394710.1057/jors.1971.18
  • GuptaJNDHeuristic rules for n × m flowshop scheduling problemOpsearch19685165170
  • GuptaJNDHeuristic algorithms for multistage flowshop scheduling problemAIIE Trans19724111810.1080/05695557208974823
  • RöckHSchmidtGMachine aggregation heuristics in shop-schedulingMethods Opl Res198345303314
  • PageESAn approach to the scheduling of jobs on machinesJ R Stat Soc196124484492
  • MortonTEPenticoDWHeuristic Scheduling Systems1993
  • AshourSA decomposition approach for the machine scheduling problemInt J Prod Res1967610912210.1080/00207546708929772
  • AshourSA modified decomposition algorithm for scheduling problemsInt J Prod Res1970828128410.1080/00207547008929846
  • GuptaJNDMaykutARFlow-shop scheduling by heuristic decompositionInt J Prod Res19731110511110.1080/00207547308929952
  • AverbakhIBermanOA simple heuristic for m-machine flow-shop and its applications in routing-scheduling problemsOpns Res19994716517010.1287/opre.47.1.165
  • AzimMAMorasRGSmithMLAntithetic sequences in flow shop schedulingComput Indust Eng19891735335810.1016/0360-8352(89)90087-9
  • HundalTSRajgopalJAn extension of Palmer heuristic for the flow shop scheduling problemInt J Prod Res1988261119112410.1080/00207548808947922
  • GuptaJNDA heuristic algorithm for the flowshop scheduling problemRAIRO Rech Opér1976106373
  • BonneyMCGundrySWSolutions to the constrained flowshop sequencing problemOpns Res Quart19762786988310.1057/jors.1976.176
  • KoulamasCA new constructive heuristic for the flowshop scheduling problemEur J Opl Res1998105667110.1016/S0377-2217(97)00027-1
  • BurnsFRookerJJohnson's three machine flow-shop conjectureOpns Res19762457858010.1287/opre.24.3.578
  • JohnsonSMOptimal two- and three-stage production schedule with setup times includedNaval Res Logist19541616810.1002/nav.3800010110
  • DannenbringDGAn evaluation of flow-shop sequence heuristicsMngt Sci1977231174118210.1287/mnsc.23.11.1174
  • SelimSZAl-TurkiUMA new heuristic algorithm for the flowshop problemModern Production Management Systems19879196
  • LaiTA note on heuristics of flow-shop schedulingOpns Res19964464865210.1287/opre.44.4.648
  • GuptaJNDTravelling salesman problem—a survey of theoretical developments and applicationsOpsearch (India)19685181192
  • StinsonJPSmithWA heuristic programming procedure for sequencing the static flowshopInt J Prod Res19822075376410.1080/00207548208947802
  • StinsonJPA heuristic algorithm for obtaining an initial solution for the travelling salesman problem1977
  • Sevast'janovSVector summation in Banach space and polynomial algorithms for flow shops and open shopsMath Opns Res1995209010310.1287/moor.20.1.90
  • LawlerELLenstraJKRinnooy KanAHGShmoysDBSequencing and scheduling: algorithms and complexityLogistics of Production and Inventor1993445522
  • SarinSLefokaMScheduling heuristic for the n-job m-machine flow shopOmega-Int J Mngt Sci19932122923410.1016/0305-0483(93)90055-P
  • AggarwalSCStaffordEA heuristic algorithm for the flowshop problem with a common sequence on all machinesDec Sci1975623725110.1111/j.1540-5915.1975.tb01016.x
  • WooDSYimHSA heuristic algorithm for mean flowtime objective in flowshop schedulingComput Opns Res19982517518210.1016/S0305-0548(97)00050-6
  • McCormickSTPinedoMLShenkerSWolfBSequencing in an assembly line with blocking to minimize cycle timeOpns Res19893792593610.1287/opre.37.6.925
  • SridharJRajendranCScheduling in flowshop an cellular manufacturing systems with multiple objectives—a genetic algorithmic approachProd Plan Control1996737438210.1080/09537289608930365
  • RajendranCHeuristic algorithm for scheduling in a flowshop to minimise total flowtimeInt J Prod Econ199329657310.1016/0925-5273(93)90024-F
  • TaillardESome efficient heuristic methods for the flow-shop sequencing problemEur J Opl Res199047657410.1016/0377-2217(90)90090-X
  • GuptaJNDMaykutARHeuristic algorithms for scheduling n jobs in a flowshopJ Opl Res Soc Japan197316131150
  • NowickiESmutnickiCA fast tabu search algorithm for the permutation flow-shop problemEur J Opl Res19969116017510.1016/0377-2217(95)00037-2
  • Stützle T (1998). An ant approach for the flow shop problem. ELITE Foundation (ed). Proceedings of EUFIT'98 Aachen, Germany. Verlag Mainz, Aachen, Germany, pp. 1560–1564.
  • HoJCChangYLA new heuristic for the n-job, m-machine flow-shop problemEur J Opl Res19915219420210.1016/0377-2217(91)90080-F
  • OsmanIHPottsCNSimulated annealing permutation flow-shop schedulingOmega-Int J Mngt Sci19891755155710.1016/0305-0483(89)90059-5
  • OgbuFASmithDKThe application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problemComput Opns Res19901724325310.1016/0305-0548(90)90001-N
  • OgbuFASmithDKSimulated annealing algorithm for the permutation flowshop problemOmega-Int J Mngt Sci199119646710.1016/0305-0483(91)90036-S
  • ZegordiSHItohKEnkawaTMinimizing makespan for flow-shop scheduling by combining simulated annealing with sequencing knowledgeEur J Opl Res19958551553110.1016/0377-2217(94)00021-4
  • GrabowskiJPemperaJNew block properties for the permutation flow shop problem with application in TSJ Opl Res Soc20015221022010.1057/palgrave.jors.2601055
  • ReevesCRA genetic algorithm for flowshop sequencingComput Opns Res19952251310.1016/0305-0548(93)E0014-K
  • MurataTIshibuchiHTanakaHGenetic algorithms for flowshop scheduling problemsComput Indust Eng1996301061107110.1016/0360-8352(96)00053-8
  • ReevesCRYamadaTGenetic algorithms, path relinking and the flowshop sequencing problemEvol Comput1998623023410.1162/evco.1998.6.1.45
  • ChenCLVempatiVSAljaberNAn application of genetic algorithms for flow shop problemEur J Opl Res19958038939610.1016/0377-2217(93)E0228-P
  • WernerFOn the heuristic solution of the permutation flow shop problem by path algorithmsComput Opns Res19932070772210.1016/0305-0548(93)90058-Q
  • TurnerSBoothDComparison of heuristics for flowshop sequencingOmega-Int J Mngt Sci198715758510.1016/0305-0483(87)90054-5
  • SmithAWStaffordEFA comparison of multiple criteria solutions of large-scale flow-shop scheduling problemsAIDS 1980 Proceedings, Vol. 219803537
  • FraminanJMLeistenRRajendranCDifferent initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problemInt J Prod Res20034112114810.1080/00207540210161650
  • AmarADGuptaJNDSimulated versus real life data in testing the efficiency of scheduling algorithmsIIE Trans198618162510.1080/07408178608975325
  • ConwayRWMaxwellWLMillerLWTheory of Scheduling1967
  • WatsonJPBarbulescuLWhitleyLDHoweAEContrasting structured and random permutation flow-shop scheduling problems: search space topology and algorithm performanceINFORMS J Comput2002149812310.1287/ijoc.14.2.98.120
  • TaillardEBenchmark for basic scheduling problemsEur J Opl Res19936427828510.1016/0377-2217(93)90182-M
  • BestwickPHastingsNA new bound for machine schedulingOpns Res Quart19762747948710.1057/jors.1976.93
  • LahiriSRajendranCNarendranTTEvaluation of heuristics for scheduling in a flowshop: a case studyProd Plan Control1993415315810.1080/09537289308919432
  • ReevesCRImproving the efficiency of tabu search for machine sequencing problemJ Opl Res Soc19934437538210.1057/jors.1993.67
  • ReevesCRLandscapes, operators and heuristic searchAnn Opns Res19998647349010.1023/A:1018983524911

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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.