A Fluid Heuristic for Minimizing Makespan in Job Shops
From MaRDI portal
Publication:3635130
DOI10.1287/opre.50.4.692.2860zbMath1163.90810OpenAlexW1978577503MaRDI QIDQ3635130
Publication date: 3 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f484d26049a5484532ef87964045bb0a448d5193
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Dynamic Server Assignment in Multiclass Queues with Shifts, with Applications to Nurse Staffing in Emergency Departments ⋮ MINIMIZING MAKESPAN IN A MULTICLASS FLUID NETWORK WITH PARAMETER UNCERTAINTY ⋮ A fluid approach to large volume job shop scheduling ⋮ Applications of fluid models in service operations management ⋮ 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 ⋮ A differential game formulation of a controlled network ⋮ Large deviation asymptotics and control variates for simulating large functions ⋮ Scheduling jobshops with some identical or similar jobs ⋮ Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan ⋮ A push-pull queueing system
