Elsevier

Omega

Volume 11, Issue 1, 1983, Pages 91-95
Omega

Main paper
A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem

https://doi.org/10.1016/0305-0483(83)90088-9Get rights and content

Abstract

In a general flow-shop situation, where all the jobs must pass through all the machines in the same order, certain heuristic algorithms propose that the jobs with higher total process time should be given higher priority than the jobs with less total process time. Based on this premise, a simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics. The results of the proposed algorithm have been compared with the results from 15 other algorithms in an independent study by Park [13], who shows that the proposed algorithm performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.

References (15)

  • S Ashour

    An experimental investigation and comparative evaluation of flow-shop scheduling techniques

    Ops Res.

    (1970)
  • KR Baker

    Introduction of Sequencing and Scheduling

    (1974)
  • HG Campbell et al.

    A heuristic algorithm for the n job, m machine sequencing problem

    Mgmt Sci.

    (1970)
  • RW Conway et al.

    Theory of Scheduling

    (1967)
  • DG Dannenbring

    An evaluation of flow-shop sequencing heuristics

    Mgmt Sci.

    (1977)
  • RA Dudek et al.

    Development of M stage decision rule for scheduling ‘n’ jobs through ‘m’ machines

    Ops Res.

    (1964)
  • JND Gupta

    A functional heuristic algorithm for the flow-shop scheduling problem

    Op. Res. Q.

    (1971)
There are more references available in the full text version of this article.

Cited by (2211)

View all citing articles on Scopus
View full text