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

DOI10.1080/00207548808947949MaRDI QIDQ3792467zbMATHOpenAlexFDO

Authors 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

Markov approximationsnumerical simulationsqueueing networkexponential approximationtotal time spent in a dynamic job shop

Mathematics Subject Classification ID

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

Recommendations

• The time spent in a dynamic job shop
• Analytical determination of optimal TWK due-dates in a job shop
• Approximate solution of a dynamic job shop model with several job classes
• Job flow-time in a job shop subject to machine breakdowns with applications in modelling job shop in-process inventories
• Analysis of Job Flow-Time in a Job Shop

Cites work

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

Cited in

(21)

• The role of put option contracts in supply chain management under inflation
• An approximation model for sojourn time distributions in acyclic multi-server queueing networks
• Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs
• Real-time due-date promising by build-to-order environments
• A dynamic forecasting model for job shop flowtime prediction and tardiness control
• Due date assignment for multistage assembly systems
• Approximate solution of a dynamic job shop model with several job classes
• Supply chain bilateral coordination with option contracts under inflation scenarios
• Predicting departure times in multi-stage queueing systems
• Transient flows in queueing systems via closure approximations
• Circulant approximation for preconditioning in stochastic automata networks
• Modelling complex assemblies as a queueing network for lead time control
• Quandary of service logistics: fast or reliable?
• Lead time selection and the behaviour of work flow in job shops
• Diversity of payment contracts in a decentralized assembly system
• Differential evolution to solve the lot size problem in stochastic supply chain management systems
• A review of open queueing network models of manufacturing systems
• The time spent in a dynamic job shop
• Real-time prediction of order flowtimes using support vector regression
• Bilateral coordination strategy of supply chain with bidirectional option contracts under inflation
• Exact Expressions for the First Two Moments of Job Flow Time in a Job Shop

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3792467)