Advanced search
Publication Cover
Journal of the Operational Research Society Volume 61, 2010 - Issue 6: Part Special Issue: Operational Research in Project Management: Pragmatic Solutions for Real Life Problems
Submit an article Journal homepage
15
Views
7
CrossRef citations to date
0
Altmetric
Theoretical Paper

New heuristics for flow shop problem to minimize makespan

D BaiNortheastern UniversityShenyangP.R. ChinaCorrespondence[email protected]
&
L TangNortheastern UniversityShenyangP.R. ChinaCorrespondence[email protected]
Pages 1032-1040 | Received 01 Mar 2008, Accepted 01 Jan 2009, Published online: 21 Dec 2017

References

  • BaiDTangLWorst case analysis of a new lower bound for flow shop weighted completion time problemThe First International Conference on Combinatorial Optimization and Applications. Lecture Notes in Computer Science2007191199
  • BramelJSimchi-LeviDThe Logic of Logistics: Theory, Algorithms, and Applications for Logistics Management1997
  • ChenBGlassCAPottsCNStrusevichVAA new heuristic for three-machine flow shop schedulingOpns Res19964489189810.1287/opre.44.6.891
  • GareyMRJohnsonDSSethiRThe complexity of flowshop and jobshop schedulingMath Opns Res1976111712910.1287/moor.1.2.117
  • GlynnPWWhittWDepartures from many queues in seriesAnn Appl Probab1991154657210.1214/aoap/1177005838
  • GonzalezTSahniSFlow shop and job shop schedules: Complexity and approximationOpns Res197826365210.1287/opre.26.1.36
  • GrahamRLLawlerELLenstraJKRinnooy KanAHGOptimization and approximation in deterministic machine sequencing and scheduling: A surveyAnn Discrete Math1979528732610.1016/S0167-5060(08)70356-X
  • HallLAApproximability of flow shop schedulingMath Program199882175190
  • IgnallISchrageLApplication of the branch-and-bound technique to some flow-shop scheduling problemsOpns Res19651340041210.1287/opre.13.3.400
  • JohnsonSMOptimal two- and three-stage production schedules with setup times includedNaval Res Log19541616810.1002/nav.3800010110
  • LenstraJKRinnooy KanAHGBruckerPComplexity of machine scheduling problemsAnn Opns Res19771343362
  • LiuHQueyranneMSimchi-LeviDOn the asymptotic optimality of algorithms for the flow shop problem with release datesNaval Res Log20055223224210.1002/nav.20066
  • PottsCNAnalysis of heuristics for two-machine flow-shop sequencing subject to release datesMath Opns Res19851057658410.1287/moor.10.4.576
  • RamudhinABartholdiJJCalvinJMVande VateJHWeissGA probabilistic analysis of two-machine flowshopsOpns Res19964489990810.1287/opre.44.6.899
  • SgallJOn-line schedulingOnline Algorithms: The State of the Art. Lecture Notes in Computer Science1998196231
  • WilliamsonDPHallLAHoogeveenJAHurkensCAJLenstraJKSevast'janovSVShmoysDBShort shop schedulesOpns Res19974528829410.1287/opre.45.2.288
  • XiaCHShanthikumarJGGlynnPWOn the asymptotic optimality of the SPT rule for the flow shop average completion time problemOpns Res20004861562210.1287/opre.48.4.615.12423

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.