From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
From MaRDI portal
Publication:1600095
DOI10.1007/s101070100272zbMath1040.90014OpenAlexW2146431819MaRDI QIDQ1600095
Jay Sethuraman, Dimitris J. Bertsimas
Publication date: 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070100272
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
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 ⋮ Production planning with load dependent lead times: An update of research ⋮ Exponential penalty function control of loss networks ⋮ Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements ⋮ Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan ⋮ Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints ⋮ Exact and approximate algorithms for high-multiplicity parallel machine scheduling
