A Functional Heuristic Algorithm for the Flowshop Scheduling Problem

Jatinder N.D. Gupta

Journal of the Operational Research Society · 1971 · 228 citations · 8 references

Concepts

Abstract

AbstractBy exploiting the relationship between scheduling and sorting, this paper describes a functional heuristic algorithm for seeking a quick and approximate solution to the n-job, M-machine flowshop scheduling problem under the assumption that all jobs are processed on all machines in the same order and no passing of jobs is permitted. The proposed functional heuristic algorithm can be executed by hand for reasonably large size problems and yields solutions which are closer to optimal solutions than those obtained by Palmer's slope index algorithm.

References

8