30
Views
10
CrossRef citations to date
0
Altmetric
Theoretical Paper

Reducing mean flow time in permutation flow shop

&
Pages 939-945 | Received 01 Nov 2005, Accepted 01 Nov 2006, Published online: 21 Dec 2017

References

  • AhmadiRHBagchiUImproved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shopEur J Opl Res19904433133610.1016/0377-2217(90)90244-6
  • AllahverdiAAldowaisanTNew heuristics to minimize total completion time in m-machine flowshopsInt J Prod Econ200277718310.1016/S0925-5273(01)00228-6
  • CampbellHGDudekRASmithMLA heuristic algorithm for n-job, m-machine sequencing problemMngt Sci19701663063710.1287/mnsc.16.10.B630
  • FraminanJMLeistenRAn efficient constructive heuristic for flowtime minimisation in permutation flowshopsOmega20033131131710.1016/S0305-0483(03)00047-1
  • FraminanJMLeistenRRuiz-UsanoRComparison of heuristics for flowtime minimisation in permutation flowshopsComput Opns Res2005321237125410.1016/j.cor.2003.11.002
  • GareyMRJohnsonDSSethiRThe complexity of flowshop and jobshop schedulingMath Opns Res1976111712910.1287/moor.1.2.117
  • HoJCFlowshop sequencing with mean flowtime objectiveEur J Opl Res19958157157810.1016/0377-2217(93)E0353-Y
  • LiuJReevesCRConstructive and composite heuristic solutions to the P//∑Ci scheduling problemEur J Opl Res200113243945210.1016/S0377-2217(00)00137-5
  • NawazMEnscoreEEHamIA heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega198311919510.1016/0305-0483(83)90088-9
  • RajendranCHeuristic algorithm for scheduling in a flowshop to minimise total flowtimeInt J Prod Econ199329657310.1016/0925-5273(93)90024-F
  • RajendranCChaudhuriDAn efficient heuristic approach to the scheduling of jobs in a flowshopEur J Opl Res19916131832510.1016/0377-2217(92)90361-C
  • RajendranCZieglerHAn efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobsEur J Opl Res199710312913810.1016/S0377-2217(96)00273-1
  • Rinnooy KanAHGMachine Scheduling Problems: Classification, Complexity, and Computations1976
  • WangCChuCProthJMHeuristic approaches for n/m/F/Σ Ci scheduling problemsEur J Opl Res19979663664410.1016/0377-2217(95)00347-9
  • WooDSYimHSA heuristic algorithm for mean flowtime objective in flowshop schedulingComput Opns Res19982517518210.1016/S0305-0548(97)00050-6

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.