Advanced search
Publication Cover
Journal of the Operational Research Society Volume 57, 2006 - Issue 10
Submit an article Journal homepage
32
Views
6
CrossRef citations to date
0
Altmetric
Technical Note

A local search method for permutation flow shop scheduling

W Q HuangHuazhong University of Science and TechnologyWuhanPR China
&
L WangHuazhong University of Science and TechnologyWuhanPR ChinaCorrespondence[email protected]
Pages 1248-1251 | Received 01 Apr 2004, Accepted 01 Jun 2005, Published online: 21 Dec 2017

References

  • CampbellHGDudekRASmithMLA heuristic algorithm for the n job m machine sequencing problemMngt Sci197016B63063710.1287/mnsc.16.10.B630
  • CarlierJOrdonnancements a contraintes disjonctivesRAIRO—Opns Res197812333351
  • ChenCLVempatiVSAljaberNAn application of genetic algorithms for flow shop problemsEur J Opl Res19958038939610.1016/0377-2217(93)E0228-P
  • DannenbringDGAn evaluation of flowshop sequencing heuristicsMngt Sci1977231174118210.1287/mnsc.23.11.1174
  • GareyMRJohnsonDSSethiRThe complexity of flow shop and job shop schedulingMath Opns Res1976111712910.1287/moor.1.2.117
  • GrabowskiJPemperaJNew block properties for the permutation flowshop problem with application in tabu searchJ Opl Res Soc20015221022010.1057/palgrave.jors.2601055
  • HaouariMLadhariTA branch-and-bound-based local search method for the flow shop problemJ Opl Res Soc2003541076108410.1057/palgrave.jors.2601612
  • LaiTCA note on the heuristic flowshop schedulingOpns Res19944464865210.1287/opre.44.4.648
  • NawazMEnscoreEEHamIA heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega198311919510.1016/0305-0483(83)90088-9
  • NowickiESmutnickiCA fast tabu search algorithm for the permutation flow-shop problemEur J Opl Res19969116017510.1016/0377-2217(95)00037-2
  • OgbuFASmithDKSimulated annealing for the permutation flowshop problemOmega199019646710.1016/0305-0483(91)90036-S
  • OsmanIHPottsCNSimulated annealing for permutation flow-shop schedulingOmega19891755155710.1016/0305-0483(89)90059-5
  • PanJHChenJSMinimizing makespan in re-entrant permutation flow-shopsJ Opl Res Soc20035464265310.1057/palgrave.jors.2601556
  • ReevesCRA genetic algorithm for flowshop sequencingComput Opns Res19952251310.1016/0305-0548(93)E0014-K
  • TaillardESome efficient heuristic methods for the flow shop sequencing problemEur J Opl Res198947657410.1016/0377-2217(90)90090-X
  • TsengFTStaffordEFGuptaJAn empirical analysis of integer programming formulations for the permutation flow shopOMEGA20043228529310.1016/j.omega.2003.12.001
  • WangLZhengDZAn effective hybrid heuristic for flow shop schedulingInt J Adv Manuf Tech200321384410.1007/s001700300005
  • WidmerMHertzAA new heuristic method for the flow shop sequencing problemEur J Opl Res19894118619310.1016/0377-2217(89)90383-4

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.