A comment on ``A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems

DOI10.1016/0167-6377(94)90044-2zbMath0823.90057OpenAlexW1987672257MaRDI QIDQ1890955

Julian Scott Yeomans

Publication date: 28 May 1995

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(94)90044-2

zbMATH Keywords

heuristicmixed-model just-in-time assembly systems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (2)

Bicriteria sequencing methods for the mixed-model assembly line in just-in-time production systems ⋮ Note on cyclic sequences in the product rate variation problem

Cites Work

• A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• A linear time algorithm for maximum matchings in convex, bipartite graphs
• A simple sequencing algorithm for mixed-model assembly lines in just-in- time production systems
• Minimizing variation of production rates in just-in-time systems: A survey
• A Note on “Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems”
• Note—Sequencing JIT Mixed-Model Assembly Lines
• Developing production schedules which balance part usage and smooth production loads for just-in-time production systems
• Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• A parallel shortest augmenting path algorithm for the assignment problem

This page was built for publication: A comment on ``A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems