The interface of buffer design and cyclic scheduling decisions in deterministic flow lines
From MaRDI portal
Publication:1339132
DOI10.1007/BF02085645zbMath0815.90092OpenAlexW2032314102MaRDI QIDQ1339132
Panagiotis Kouvelis, Selçuk Karabatı
Publication date: 1 December 1994
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02085645
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Properties of duality in tandem queueing systems
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- A concise survey of efficiently solvable special cases of the permutation flow-shop problem
- A Comparative Study of Flow-Shop Algorithms
- Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
- Cyclic scheduling in flow lines: Modeling observations, effective heuristics and a cycle time minimization procedure
This page was built for publication: The interface of buffer design and cyclic scheduling decisions in deterministic flow lines