Makespan minimization in preemptive two machine job shops
From MaRDI portal
Publication:1377264
DOI10.1007/BF02684330zbMath0889.68013MaRDI QIDQ1377264
Gerhard J. Woeginger, Sergey Sevast'janov
Publication date: 2 June 1998
Published in: Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (3)
On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion ⋮ On-line and off-line preemptive two-machine job shop scheduling ⋮ Approximation algorithms for shop scheduling problems with minsum objective
Cites Work
- Unnamed Item
- Makespan minimization in open shops: A polynomial time approximation scheme
- Preemptive job-shop scheduling problems with a fixed number of jobs
- An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Improved Approximation Algorithms for Shop Scheduling Problems
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: Makespan minimization in preemptive two machine job shops
