Journal Article10.1016/S0196-6774(02)00251-1
A (2 + ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective
35
TL;DR: The main result is a (2 + e)- approximation algorithm for this problem that is a generalized version of the classical preemptive open shop problem with sum of weighted job completion times objective.
read more
About: This article is published in Journal of Algorithms. The article was published on 01 Nov 2002. The article focuses on the topics: Open shop & Job shop.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints
TL;DR: In this paper, the authors introduce the packing scheduling problem (PSP), a general scheduling problem where jobs can have different arrival times and sizes; a scheduler can process job $j$ at rate $x_j$ subject to arbitrary packing constraints over the set of rates of the outstanding jobs.
34
Near Optimal Coflow Scheduling in Networks
Mosharaf Chowdhury,Samir Khuller,Manish Purohit,Sheng Yang,Jie You +4 more
- 17 Jun 2019
TL;DR: This work studies a slightly different model of coflow scheduling in general graphs and develops practical and efficient approximation algorithms for it, and develops a randomized 2 approximation algorithm for the single path and free path model.
32
Improved bounds for scheduling conflicting jobs with minsum criteria
TL;DR: This work improves the best-known results for scheduling conflicting jobs with the min-sum objective, on several fundamental classes of graphs, including line graphs, (k + 1)-claw-free graphs, and perfect graphs and obtains the first constant-factor approximation ratio for nonpreemptive scheduling on interval graphs.
Improved results for data migration and open shop scheduling
TL;DR: In this article, the authors gave a 5.06-approximation algorithm for the Ovrjv ∑wjCj problem, which is a special case of the data migration problem.
Improved bounds for sum multicoloring and scheduling dependent jobs with minsum criteria
Rajiv Gandhi,Magnús M. Halldórsson,Guy Kortsarz,Hadas Shachnai +3 more
- 14 Sep 2004
TL;DR: Using the technique, the best known results for pSMC and npSMC on several fundamental classes of graphs are improved, including line graphs, (k + 1)-claw free graphs and perfect graphs, and the first constant factor approximation ratio for npS MC on interval graphs is obtained.
References
Sequencing and scheduling: algorithms and complexity
Eugene L. Lawler,Jan Karel Lenstra,A. H. G. Rinnooy Kan,David B. Shmoys +3 more
- 01 Jan 1989
TL;DR: This survey focuses on the area of deterministic machine scheduling, and reviews complexity results and optimization and approximation algorithms for problems involving a single machine, parallel machines, open shops, flow shops and job shops.
Sequencing and scheduling : algorithms and complexity
Eugene L. Lawler,Jan Karel Lenstra,Ahg Alexander Rinnooy Kan,David B. Shmoys +3 more
- 01 Jan 1993
TL;DR: A survey of deterministic machine scheduling can be found in this article, where complexity results and optimization and approximation algorithms for problems involving a single machine, parallel machines, open shops, flow shops and job shops are presented.
1.1K
Open Shop Scheduling to Minimize Finish Time
Teofilo F. Gonzalez,Sartaj Sahni +1 more
TL;DR: It is shown that the problem of obtaining minimum finish time nonpreemptive schedules when the open shop has more than two processors is NP-complete.
712
Scheduling theory single-stage systems
V. S. Tanaev,Valery Gordon,Yakov M. Shafransky +2 more
- 01 Jan 1994
TL;DR: This book discusses the Reducibility of the Partition Problem, priority-Generating Functions, and Approximation Algorithms in the context of NP problems.
149