From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
type: Item
instance of: scholarly article
title: From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
zbMATH Open document ID: 1040.90014
author: Jay Sethuraman
author: Dimitris Bertsimas
published in: Mathematical Programming. Series A. Series B
publication date: 2002-01-01T00:00:00Z
review text: The authors consider the problem of scheduling non-preemptable jobs in a job shop systems in order to minimize schedule length. The presented approach is based on the ideas from queuing theory used in communication networks. The presented algorithm, called the fluid synchronization algorithm, produces approximate schedules with a relative error being competitive to other known dispatching rules.
reviewed by: Jacek Blazewicz
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 1754741
zbMATH Keywords: scheduling
zbMATH Keywords: job shop
zbMATH Keywords: makespan criterion
MaRDI profile type: Publication
full work available at URL: s101070100272
OpenAlex ID: W2146431819
DOI: 10.1007/S101070100272
description: scientific article; zbMATH DE number 1754741