44
Views
18
CrossRef citations to date
0
Altmetric
Theoretical Paper

A partial enumeration heuristic for multi-objective flowshop scheduling problems

&
Pages 1000-1007 | Received 01 Jun 2002, Accepted 01 Feb 2004, Published online: 21 Dec 2017

References

  • PanwalkarSSDudekRASmithMLSequencing research and the industrial scheduling problemSymposium on the Theory of Scheduling and its Applications1973
  • EhrgottMGandibleuxXA survey and annotated bibliography of multicriteria combinatorial optimizationOR Spektrum20002242546010.1007/s002910000046
  • T′kindtVBillautJ-CMulticriteria scheduling problems: a surveyRAIRO Opns Res20013514316310.1051/ro:2001109
  • SridharJRajendranCScheduling in flowshop and cellular manufacturing systems with multiple objectives—a genetic algorithm approachProd Planning Control1996737438210.1080/09537289608930365
  • ChakravarthyKRajendranCA heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimizationProd Planning Control19991070771410.1080/095372899232777
  • RajendranCZieglerHScheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup timesEur J Opns Res200314951352210.1016/S0377-2217(02)00485-X
  • AllahverdiAThe tricriteria two-machine flowshop scheduling problemInt Trans Opl Res2001840342510.1111/1475-3995.00273
  • AllahverdiAThe two and m machines flowshop scheduling problems with bicriteria of makespan and mean flowtimeEur J Opns Res200314737339610.1016/S0377-2217(02)00253-9
  • AllahverdiAA new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardinessComput Opns Res20043115718010.1016/S0305-0548(02)00143-0
  • GuptaJNDPalanimuthuNChenCLDesigning a tabu search algorithm for the two-stage flow shop problem with secondary criterionProd Planning Control19991025126510.1080/095372899233217
  • GuptaJNDHennigKWernerFLocal search heuristics for two-stage flow shop problems with secondary criterionComput Opns Res20002912314910.1016/S0305-0548(00)00061-7
  • GuptaJNDNeppalliVRWernerFMinimizing total flow time in a two-machine flowshop problem with minimum makespanInt J Prod Econ20006932333810.1016/S0925-5273(00)00039-6
  • DanielsRLChambersRJMultiobjective flow-shop schedulingNaval Res Logist19903798199510.1002/1520-6750(199012)37:6<981::AID-NAV3220370617>3.0.CO;2-H
  • LiaoCJYuWCJoeCBBicriterion scheduling in the two-machine flowshopJ Opl Res Soc19974892993510.1057/palgrave.jors.2600442
  • SayinSKarabatiSA bicriteria approach to the two-machine flow shop scheduling problemEur J Opns Res199911343544910.1016/S0377-2217(98)00009-5
  • FraminanJMLeistenRRuiz-UsanoREfficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimizationEur J Opns Res200214155956910.1016/S0377-2217(01)00278-8
  • MurataTIshibuchiHTanakaHMulti-objective genetic algorithm and its applications to flowshop schedulingComput Ind Engng19963095796810.1016/0360-8352(96)00045-9
  • IshibuchiHMurataTA multi-objective genetic local search algorithm and its application to flowshop schedulingIEEE Trans Systems Man Cybernet, Part C Appl Rev19982839240310.1109/5326.704576
  • MurataTIshibuchiHGenMSpecification of genetic search directions in cellular multi-objective genetic algorithmsEvolutionary Multi-Criterion Optimization20018295
  • JonesDSMirrazaviTamisMMulti-objective meta-heuristics: an overview of the current state-of-the-artEur J Opns Res20021371910.1016/S0377-2217(01)00123-0
  • NawazMEnscoreEEHamIA heuristic algorithm for the m-machine, n-job flowshop sequencing problemOmega198311919810.1016/0305-0483(83)90088-9
  • ArmentanoVARonconiDPTabu search for total tardiness minimization in flowshop scheduling problemsComput Opns Res19992621923510.1016/S0305-0548(98)00060-4
  • Arroyo JEC (2002). Heurísticas e Metaheurísticas para Otimização Combinatória Multiobjetivo. Doctoral thesis, Faculdade de Engenharia Elétrica e de Computação, Universidade Estadual de Campinas, Brazil (in Portuguese).
  • BakerKRKanetJJJob shop scheduling with modified due datesJ Opns Mngt Sci198341122
  • HolthausORajendranCEfficient dispatching rules for scheduling in a job shopInt J Prod Econ1997488710510.1016/S0925-5273(96)00068-0
  • HolthausORajendranCEfficient jobshop dispatching rules: further developmentsProd Planning Control20001117117810.1080/095372800232379
  • JohnsonSMOptimal two- and three-stage production schedules with set-up times includedNaval Res Logist Q19541616810.1002/nav.3800010110
  • TaillardEBenchmarks for basic scheduling problemsEur J Opns Res19936427828510.1016/0377-2217(93)90182-M
  • Hansen MP and Jaszkiewicz A (1998). Evaluating the quality of approximations to the nondominated set. Technical Report, Institute of Mathematical Modeling, Technical University of Denmark.
  • CzyzakPJaszkiewiczAPareto simulated annealing — a metaheuristic technique for multiple objective combinatorial optimizationJ Multi-Criteria Decis Anal19987344710.1002/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6
  • UlunguELTeghemJOst ChEfficiency of interactive multi-objective simulated annealing through a case studyJ Opl Res Soc1998491044105010.1057/palgrave.jors.2600569

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.