Modelling complex assemblies as a queueing network for lead time control

DOI10.1016/j.ejor.2005.01.025zbMath1116.90042OpenAlexW2032131392MaRDI QIDQ858340

Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatoshi Sakawa

Publication date: 9 January 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.01.025

zbMATH Keywords

queueingcontrolproductionmultiple objective programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (9)

A change point control chart for monitoring the production lead time based on sum of squared ranks ⋮ Part sojourn time distribution in a two-machine line ⋮ Longest path analysis in networks of queues: dynamic scheduling problems ⋮ A multi-objective lead time control problem in multi-stage assembly systems using genetic algorithms ⋮ Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks ⋮ A multi-objective lead time control problem in multistage assembly systems using an interactive method ⋮ Due date assignment for multistage assembly systems ⋮ PERFORMANCE EVALUATION OF OPEN QUEUEING NETWORKS WITH FUZZY PARAMETERS ⋮ Due-date assignment for multi-server multi-stage assembly systems

Cites Work

• Unnamed Item
• Assembly-like queues with finite capacity: Bounds, asymptotics and approximations
• Survey of scheduling research involving due date determination decisions
• Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines
• A Markovian single server with upstream job and downstream demand arrival stream
• Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
• Optimal control of service rates and arrivals in Jackson networks
• Performance analysis and buffer allocations in some open assembly systems.
• Multi-objective routing within large scale facilities using open finite queueing networks
• Approximations for the time spent in a dynamic job shop with applications to due-date assignment
• Decentralized control of service rates in a closed Jackson network
• Due Date Assignment for Production Systems
• Steady state waiting time in a multicenter job shop
• Markov and Markov-Regenerative <scp>pert</scp> Networks
• Optimal Control of Arrivals to Token Ring Networks with Exhaustive Service Discipline
• Assembly-like queues
• Critical Path Analyses Via Chance Constrained and Stochastic Programming
• Distribution of the Time Through a Directed, Acyclic Network

This page was built for publication: Modelling complex assemblies as a queueing network for lead time control