Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan

DOI10.1007/S10878-018-0294-6zbMATH Open1400.90182OpenAlexW2801117692MaRDI QIDQ724743FDOQ724743

Authors: Jinwei Gu, Manzhan Gu, Ying Zhang, Xiwen 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

Recommendations

• An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan
• scientific article; zbMATH DE number 4099021
• Performance analysis of policy of heuristic for the stochastic flexible flow shop weighted completion time scheduling problem
• Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
• Static routing in stochastic scheduling: performance guarantees and asymptotic optimality

zbMATH Keywords

job shopstochastic schedulingasymptotical optimalityfluid relaxation

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Cites Work

• 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 (4)

• Asymptotically optimal production policies in dynamic stochastic jobshops with limited buffers
• Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem
• A hybrid fluid master–apprentice evolutionary algorithm for large-scale multiplicity flexible job-shop scheduling with sequence-dependent set-up time
• An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan

This page was built for publication: Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724743)