An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan
From MaRDI portal
Publication:511693
DOI10.1007/S10878-015-9974-7zbMATH Open1362.90188OpenAlexW2174268271MaRDI QIDQ511693FDOQ511693
Xiwen Lu, Manzhan Gu, Jinwei Gu
Publication date: 22 February 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9974-7
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions
- A simplex based algorithm to solve separated continuous linear programs
- The Complexity of Flowshop and Jobshop Scheduling
- On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions
- The expected asymptotical ratio for preemptive stochastic online problem
- Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
- 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
- Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem
- Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
- Scheduling jobshops with some identical or similar jobs
- A fluid approach to large volume job shop scheduling
- An algorithm for the maximum revenue jobshop problem
Cited In (2)
This page was built for publication: An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q511693)
