Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan
type: Item
instance of: scholarly article
title: Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan
zbMATH Open document ID: 1400.90182
author: Jinwei Gu
author: Manzhan Gu
author: Ying Zhang
author: Xiwen Lu
published in: Journal of Combinatorial Optimization
publication date: 2018-07-26T00:00:00Z
Mathematics Subject Classification ID: 90B36
zbMATH DE Number: 6910550
zbMATH Keywords: stochastic scheduling
zbMATH Keywords: job shop
zbMATH Keywords: fluid relaxation
zbMATH Keywords: asymptotical optimality
MaRDI profile type: Publication
full work available at URL: s10878-018-0294-6
OpenAlex ID: W2801117692
cites work: Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
cites work: From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
cites work: From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective
cites work: Scheduling jobshops with some identical or similar jobs
cites work: Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
cites work: A Fluid Heuristic for Minimizing Makespan in Job Shops
cites work: The expected asymptotical ratio for preemptive stochastic online problem
cites work: Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem
cites work: A fluid approach to large volume job shop scheduling
cites work: An algorithm for the maximum revenue jobshop problem
DOI: 10.1007/S10878-018-0294-6
description: scientific article; zbMATH DE number 6910550