Combinatorial evaluation of six dispatching rules in a dynamic two-machine flow shop

H. Sarper and M. C. Henry

Omega, 1996, vol. 24, issue 1, 73-81

Abstract: The paper applies permutations of six dispatching rules to a two-machine dynamic flow shop operating as a Poisson process. The size of the second queue is later limited to study the effect of limited buffer space. The performance measures examined are mean and maximum flow times, mean tardiness, and the mean absolute lateness. The best permutations for each case are determined statistically.

Keywords: simulation; two-machine; flow; shop; limited; buffer; space (search for similar items in EconPapers)
Date: 1996
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0305-0483(95)00049-6
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:24:y:1996:i:1:p:73-81

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().