Technical Note—Three-Stage Flow-Shops with Recessive Second Stage | Zendy

Fennell Burns | Zendy; John Rooker | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Technical Note—Three-Stage Flow-Shops with Recessive Second Stage

Author(s) -

Fennell Burns,

John Rooker

Publication year - 1978

Publication title -

operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.797

H-Index - 140

eISSN - 1526-5463

pISSN - 0030-364X

DOI - 10.1287/opre.26.1.207

Subject(s) - stage (stratigraphy) , schedule , mathematical optimization , flow (mathematics) , computer science , job shop scheduling , flow shop scheduling , maximum flow problem , operations research , mathematics , algorithm , biology , paleontology , geometry , operating system

Several papers have described special structural properties for which the minimum makespan flow-shop problem can be efficiently solved. We describe a new special case of the 3 × n problem with small second-stage processing times relative to the first and third stages for which Johnson's algorithm gives an optimal schedule.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research