Approximate solution of a dynamic job shop model with several job classes

DOI10.1016/0377-2217(93)90040-TzbMath0782.90039OpenAlexW2075155256MaRDI QIDQ1310003

Pasquale Legato

Publication date: 20 December 1993

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

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90040-t

zbMATH Keywords

approximate solutionhierarchical decompositionflexible manufacturingclass aggregationclosed job shop systemnonproduct form queueing networkstochastic job shops

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22) Production models (90B30)

Related Items (2)

A queuing network model for the management of berth crane operations ⋮ Berth planning and resources optimisation at a container terminal via discrete event simulation

Cites Work

• Unnamed Item
• Unnamed Item
• A mathematical model of a flexible manufacturing system with limited in- process inventory
• The exponentialization approach to flexible manufacturing system models with general processing times
• Computational aspects of aggregation in multiple class queueing networks
• An Approximate Analytical Method for General Queueing Networks
• Mean-Value Analysis of Closed Multichain Queuing Networks
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Multiple channel queues in heavy traffic
• Computational algorithms for closed queueing networks with exponential servers

This page was built for publication: Approximate solution of a dynamic job shop model with several job classes