Approximations for the time spent in a dynamic job shop with applications to due-date assignment

DOI10.1080/00207548808947949zbMath0647.90038OpenAlexW2012868624MaRDI QIDQ3792467

J. George Shanthikumar, Ushio Sumita

Publication date: 1988

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207548808947949

zbMATH Keywords

queueing networknumerical simulationsMarkov approximationsexponential approximationtotal time spent in a dynamic job shop

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (16)

Differential evolution to solve the lot size problem in stochastic supply chain management systems ⋮ Modelling complex assemblies as a queueing network for lead time control ⋮ An approximation model for sojourn time distributions in acyclic multi-server queueing networks ⋮ Bilateral coordination strategy of supply chain with bidirectional option contracts under inflation ⋮ The role of put option contracts in supply chain management under inflation ⋮ Diversity of payment contracts in a decentralized assembly system ⋮ Quandary of service logistics: fast or reliable? ⋮ Supply chain bilateral coordination with option contracts under inflation scenarios ⋮ Transient flows in queueing systems via closure approximations ⋮ A review of open queueing network models of manufacturing systems ⋮ Real-time prediction of order flowtimes using support vector regression ⋮ Predicting departure times in multi-stage queueing systems ⋮ Real-time due-date promising by build-to-order environments ⋮ Due date assignment for multistage assembly systems ⋮ Circulant approximation for preconditioning in stochastic automata networks ⋮ Lead time selection and the behaviour of work flow in job shops

Cites Work

• The time spent in a dynamic job shop
• The matrix Laguerre transform
• Bilateral phase-type distributions
• First-passage times with PF_r densities
• Due Date Assignment for Production Systems
• Note—Some Results on Sojourn Times in Acyclic Jackson Networks

This page was built for publication: Approximations for the time spent in a dynamic job shop with applications to due-date assignment