Scheduling Workforce and Workflow in a High Volume Factory

DOI10.1287/mnsc.43.2.158zbMath0889.90075MaRDI QIDQ4367202

Richard C. Larson, Edieal J. Pinker, Oded Berman

Publication date: 22 June 1998

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.43.2.158

zbMATH Keywords

queueing networks; discrete time linear time-invariant systems; flow of work-in-progress; Markovian routings; object-oriented linear programming

Mathematics Subject Classification ID

90C05: Linear programming

90B35: Deterministic scheduling theory in operations research

90B22: Queues and service in operations research

90B30: Production models

Related Items

Flexible weekly tour scheduling for postal service workers using a branch and price, Assigning cross-trained workers to departments: a two-stage optimization model to maximize utility and skill improvement, The task assignment problem for unrestricted movement between workstation groups, Sequencing the processing of incoming mail to match an outbound truck delivery schedule, On the stable Gani-type attainability problem controlled by promotion at maximum entropy, A decomposition-based heuristic for large employee scheduling problems with inter-department transfers, Optimal workforce size and allocation for urban retail chains, Workforce planning at USPS mail processing and distribution centers using stochastic optimization, Generating labor requirements and rosters for mail handlers using simulation and optimization, Comparative approaches to equipment scheduling in high volume factories, On the Prevention of Fraud and Privacy Exposure in Process Information Flow