Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan
From MaRDI portal
Publication:724743
DOI10.1007/s10878-018-0294-6zbMath1400.90182OpenAlexW2801117692MaRDI QIDQ724743
Ying Zhang, Jinwei Gu, Manzhan Gu, Xi-wen Lu
Publication date: 26 July 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-018-0294-6
Cites Work
- The expected asymptotical ratio for preemptive stochastic online problem
- Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem
- A fluid approach to large volume job shop scheduling
- Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
- An algorithm for the maximum revenue jobshop problem
- From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
- A Fluid Heuristic for Minimizing Makespan in Job Shops
- From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective
- Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
- Scheduling jobshops with some identical or similar jobs
