An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan

DOI10.1007/s10878-015-9974-7zbMath1362.90188OpenAlexW2174268271MaRDI QIDQ511693

Manzhan Gu, Jinwei Gu, Xi-wen Lu

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

zbMATH Keywords

makespanjob shopavailable constrainbatch machineflexible machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

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
• A simplex based algorithm to solve separated continuous linear programs
• An algorithm for the maximum revenue jobshop problem
• From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
• On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions
• 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
• The Complexity of Flowshop and Jobshop Scheduling
• Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
• Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions
• Scheduling jobshops with some identical or similar jobs

This page was built for publication: An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan