37
Views
41
CrossRef citations to date
0
Altmetric
Original Articles

A heuristic proǵramminǵ procedure for sequencinǵ the static flowshop

&
Pages 753-764 | Received 03 Mar 1982, Published online: 06 Apr 2007

References

  • BAKER , K. R. , 1975 , A comparative study of flow-shop algorithms , Operations Research , 23 , 62 .
  • CAMPBELL, H, G, DUDEK , R. A. , and SMITH , M. L. , 1970 , A heuristic algorithm for then job m machine sequencing problem , Management Science , 16 , B630 .
  • DANNENBRING , D. G. , 1973 , The Evaluation of Heuristic Solution Procedures for Large Combinatorial Problems , unpublished Ph.D. Dissertation , Columbia .
  • GIGLIO , R. J. , and WAGNER , H. M. , 1964 , Approximate solutions to the three machine scheduling problem , Operations Research , 12 , 305 .
  • GUPTA , J. N. D. , 1972 , Heuristic algorithms for multistage flowshop scheduling problem , A.I.I.E. Transactions , 4 , 11 .
  • GUPTA , J. N. D. , and DUDEK , R. A. , 1971 , Optimality criteria for flowshop schedule , A.I.I.E. Transactions . 3 , 199 .
  • GUPTA , J. N. D. ,and MAYKUT, A, R., 1973 , Flow shop scheduling by heuristic decomposition , International Journal of Production Research , 11 , 105 .
  • IGNALL , E. , and SCHRAGE , L. , 1965 , Application of the branch-and-bound technique to some flow-shop scheduling problems , Operations Research , 13 , 400 .
  • KRONE , M. J. , and STEIGLITZ , K. , 1974 , Heuristic-programming solution of a flowshop scheduling problem , Operations Research , 22 , 629 .
  • LOMNICKI , Z. A. , 1965 , A branch and bound algorithm for the exact solution of the three-machine scheduling problem , Operational Research Quarterly , 16 , 89 .
  • MCMAHON , G. B. ,and BURTON , P.G. , 1967 , Flow-shop scheduling with the branch and bound method , Operations Research , 15 , 473 .
  • PAGE , E. S. , 1961 , An approach to the scheduling of jobs on machines , Journal of the Royal Statistical Society B , 23 , 484 .
  • PALMER , D. S. , 1965 , Sequencing jobs through a multi stage process in the minimum total time-a quick method of obtaining a near optimum , Operational Research Quarterly , 16 , 101 .
  • STINSON , J. P. , 1977 , A Heuristic Algorithm for Obtaining an Initial Solution for the Travelling Salesman Problem , School of Management Working Paper 77-12 , Syracuse University , Syracuse , New York .

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.