A DESCRIPTIVE PROOF FOR JOHNSON'S ALGORITHM FOR SOLVING TWO-MACHINE FLOW-SHOP PROBLEM

Authors

  • Z. A. Vattai

Abstract

This paper shows a demonstrative proof of Johnson 's algorithm to the problem F2 max. By the help of the applied method an algorithm can be formed to soh'e F2 overlap Ic max problem too,

Keywords:

scheduling, sequencing, flow-shop, operations research

Citation data from Crossref and Scopus

Crossref
Scopus
Google Scholar
Europe PMC

How to Cite

Vattai, Z. A. “A DESCRIPTIVE PROOF FOR JOHNSON’S ALGORITHM FOR SOLVING TWO-MACHINE FLOW-SHOP PROBLEM”, Periodica Polytechnica Civil Engineering, 37(3), pp. 249–260, 1993.

Issue

Vol. 37 No. 3 (1993)

Section

Research Article