Access the full text.
Sign up today, get DeepDyve free for 14 days.
U. Feige (1998)
A threshold of ln n for approximating set coverJ. ACM, 45
M. Mastrolilli, M. Queyranne, Andreas Schulz, O. Svensson, Nelson Uhan (2010)
Minimizing the sum of weighted completion times in a concurrent open shopOper. Res. Lett., 38
J. Framiñan, P. Perez-Gonzalez, Victor Fernandez-Viagas (2019)
Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution proceduresEur. J. Oper. Res., 273
H. Ilani, E. Shufan, Tal Grinshpoun (2017)
Partially concurrent open shop scheduling with integral preemptionsAnnals of Operations Research, 259
Irit Dinur, David Steurer (2013)
Analytical approach to parallel repetitionProceedings of the forty-sixth annual ACM symposium on Theory of computing
T. Cheng, Q. Nong, C. Ng (2011)
Polynomial‐time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion timeNaval Research Logistics (NRL), 58
Subhash Khot (2002)
On the power of unique 2-prover 1-round gamesProceedings 17th IEEE Annual Conference on Computational Complexity
Andreas Schulz (1996)
Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds
Tal Grinshpoun, H. Ilani, E. Shufan (2017)
The representation of partially-concurrent open shop problemsAnnals of Operations Research, 252
J. Leung, Haibing Li, Michael Pinedo (2006)
Scheduling orders for multiple product types with due date related objectivesEur. J. Oper. Res., 168
Naveen Garg, Amit Kumar, Vinayaka Pandit (2007)
Order Scheduling Models: Hardness and Algorithms
R. Ahmadi, U. Bagchi, T. Roemer (2005)
Coordinated scheduling of customer orders for quick responseNaval Research Logistics (NRL), 52
J. Moore (1968)
An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late JobsManagement Science, 15
T. Roemer (2006)
A note on the complexity of the concurrent open shop problemJournal of Scheduling, 9
J. Framiñan, P. Perez-Gonzalez (2018)
Order scheduling with tardiness objective: Improved approximate solutionsEur. J. Oper. Res., 266
N. Bansal, Subhash Khot (2010)
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
[The concurrent open shop scheduling permits processing more than one operation of the same job at a time, which is the main difference from traditional open shop scheduling. We use the abbreviation cncnt of the word concurrent to denote concurrent open shopConcurrent open shop scheduling in the extended Graham et al. notation [14]. Thus the problem O|cncnt|∑Ci\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$O|\text{cncnt}| \sum C_i$$ \end{document} denotes the problem of minimization total completion timeTotal completion time for concurrent open shopConcurrent open shops.]
Published: Oct 31, 2021
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.