Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing

DOI10.1006/jagm.1999.1047zbMath0944.68006OpenAlexW1973473808MaRDI QIDQ4935311

David Gamarnik, Dimitris J. Bertsimas

Publication date: 19 March 2000

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1999.1047

zbMATH Keywords

job shop schedulingpacket routing problems

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (13)

Dynamics on Linear Influence Network Games Under Stochastic Environments ⋮ STEADY-STATE SCHEDULING ON HETEROGENEOUS CLUSTERS ⋮ A fluid approach to large volume job shop scheduling ⋮ Optimal control of a two-server flow-shop network ⋮ Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem ⋮ An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan ⋮ An algorithm for the maximum revenue jobshop problem ⋮ Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements ⋮ Scheduling jobshops with some identical or similar jobs ⋮ Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan ⋮ Asymptotic behavior of the processes describing some insurance models ⋮ Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints ⋮ A push-pull queueing system

This page was built for publication: Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing