On-line and off-line preemptive two-machine job shop scheduling
type: Item
instance of: scholarly article
title: On-line and off-line preemptive two-machine job shop scheduling
zbMATH Open document ID: 0989.90066
author: Tracy Kimbrel
author: Jared Saia
published in: Journal of Scheduling
publication date: 2001-05-13T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1556543
zbMATH Keywords: on-line algorithms
zbMATH Keywords: job shop scheduling
zbMATH Keywords: preemption
zbMATH Keywords: randomized algorithms
MaRDI profile type: Publication
cites work: Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
cites work: Improved Approximation Algorithms for Shop Scheduling Problems
cites work: Q5501839
cites work: Makespan minimization in preemptive two machine job shops
cites work: A combined BIT and TIMESTAMP algorithm for the list update problem
cites work: Q4223058
DOI: 10.1002/1099-1425(200011/12)3:6%3C355::AID-JOS55%3E3.0.CO;2-V
description: scientific article; zbMATH DE number 1556543