The evolution of schematic representations of flow shop scheduling problems

S. S. Panwalkar () and Christos Koulamas ()
Additional contact information
S. S. Panwalkar: Johns Hopkins University
Christos Koulamas: Florida International University

Journal of Scheduling, 2019, vol. 22, issue 4, No 1, 379-391

Abstract: Abstract The schematic representation of schedules has been a useful tool for researchers; in this paper, we review existing network-based schematics for flow shop models. We also propose new schematics for flow shops with blocking, synchronous transfers, no-wait processing, no-idle time and limited buffer space. Using schematics, we explain some of the past findings and present new results. We also explain flow shop anomalies/paradoxes. Finally, we propose schematics for four flow shop models using the concept of string analog.

Keywords: Scheduling; Flow shop; Network; Schematics; Anomaly (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-018-0594-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jsched:v:22:y:2019:i:4:d:10.1007_s10951-018-0594-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-018-0594-9

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().