Journal of the Operational Research Society

, Volume 39, Issue 4, pp 359–364 | Cite as

Two-Stage, Hybrid Flowshop Scheduling Problem

  • Jatinder N. D. Gupta
Theoretical Paper


This paper describes the two-stage flowshop problem when there are identical multiple machines at each stage, and shows that the problem is NP-complete. An efficient heuristic algorithm is developed for finding an approximate solution of a special case when there is only one machine at stage 2. The effectiveness of the proposed heuristic algorithm in finding a minimum makespan schedule is empirically evaluated and found to increase with the increase in the number of jobs.


heuristics production scheduling sequencing 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Operational Research Society 1988

Authors and Affiliations

  • Jatinder N. D. Gupta
    • 1
  1. 1.Department of Management ScienceBall State UniversityUSA

Personalised recommendations