Maximizing the throughput of a rotating Seru with nonpreemptive discrete stations

DOI10.1002/nav.22140zbMath1530.90035OpenAlexW4384824312MaRDI QIDQ6179286

Jiafu Tang, Unnamed Author, Yong Yin, Yaoxin Zhang, Dongni Li

Publication date: 16 January 2024

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.22140

zbMATH Keywords

production systemsorder pickingbucket brigadework coordination

Mathematics Subject Classification ID

Production models (90B30) Theory of organizations, manpower planning in operations research (90B70)

Cites Work

• Bucket brigades revisited: are they always effective?
• Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect
• Bucket brigades with worker learning
• TECHNICAL NOTE—Cellular Bucket Brigades
• Deterministic chaos in a model of discrete manufacturing
• Period Three Implies Chaos
• A Production Line that Balances Itself
• An implementation framework for seru production
• An exact quadratic programming approach based on convex reformulation for seru scheduling problems
• An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts

This page was built for publication: Maximizing the throughput of a rotating Seru with nonpreemptive discrete stations