On-line and off-line preemptive two-machine job shop scheduling

DOI<link itemprop=identifier href="https://doi.org/10.1002/1099-1425(200011/12)3:6<355::AID-JOS55>3.0.CO;2-V" /><355::AID-JOS55>3.0.CO;2-V 10.1002/1099-1425(200011/12)3:6<355::AID-JOS55>3.0.CO;2-VzbMath0989.90066MaRDI QIDQ1592758

Jared Saia, Tracy Kimbrel

Publication date: 13 May 2001

Published in: Journal of Scheduling (Search for Journal in Brave)

zbMATH Keywords

job shop schedulingon-line algorithmsrandomized algorithmspreemption

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• A combined BIT and TIMESTAMP algorithm for the list update problem
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Makespan minimization in preemptive two machine job shops
• Improved Approximation Algorithms for Shop Scheduling Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: On-line and off-line preemptive two-machine job shop scheduling