Minimizing the sum of weighted completion times in a concurrent open shop

Operations Research Letters

Volumn 38, Issue 5, 2010, Pages 390-395

  Mastrolilli, Monaldo ^a   Queyranne, Maurice ^b   Schulz, Andreas S ^c   Svensson, Ola ^d   Uhan, Nelson A ^e  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^e SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

Author keywords

Approximation algorithm; Hardness of approximation; Integrality gap; Scheduling

Indexed keywords

HARDNESS OF APPROXIMATION; INTEGRALITY GAPS; LINEAR PROGRAMMING RELAXATION; OPEN SHOP; PRIMAL-DUAL; UNIQUE GAMES CONJECTURE; WEIGHTED COMPLETION;

HARDNESS; OPTIMIZATION; SCHEDULING ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 77957899966     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2010.04.011     Document Type: Article

References (23)

1. R.H. Ahmadi, and U. Bagchi Scheduling of multi-job customer orders in multi-machine environments 1990 ORSA/TIMS Philadelphia
2. R.H. Ahmadi, U. Bagchi, and T. Roemer Coordinated scheduling of customer orders for quick response Naval Research Logistics 52 2005 493 512
3. N. Bansal, S. Khot, Inapproximability of hypergraph vertex cover and applications to scheduling problems, Working paper, 2009.
4. Z.-L. Chen, N.G. Hall, Supply chain scheduling: assembly systems, working paper, Department of Systems Engineering, University of Pennsylvania, 2001.
5. I. Dinur, V. Guruswami, S. Khot, and O. Regev A new multilayered PCP and the hardness of hypergraph vertex cover SIAM Journal on Computing 34 2005 1129 1146
6. N. Garg, A. Kumar, and V. Pandit Order scheduling models: hardness and algorithms V. Arvind, S. Prasad, Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2007 Lecture Notes in Computer Science vol. 4855 2007 Springer Berlin 96 107
7. L.A. Hall, A.S. Schulz, D.B. Shmoys, and J. Wein Scheduling to minimize average completion time: off-line and on-line approximation algorithms Mathematics of Operations Research 22 1997 513 544
8. J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Management Science Research Project Research Report 43, University of California, Los Angeles, 1955.
9. S. Khot, On the power of unique 2-prover 1-round games, in: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC 2002, 2002, pp. 767775. (Pubitemid 35009440)
10. S. Khot, and O. Regev Vertex cover might be hard to approximate within 2 - ε Journal of Computer and System Sciences 74 2008 335 349
11. A. Kumar, R. Manokaran, M. Tulsiani, N.K. Vishnoi, On LP-based approximability for strict CSPs, Working paper, 2010.
12. J.Y.-T. Leung, H. Li, and M.L. Pinedo Order scheduling in an environment with dedicated resources in parallel Journal of Scheduling 8 2005 355 386
13. J.Y.-T. Leung, H. Li, and M. Pinedo Scheduling orders for multiple product types to minimize total weighted completion time Discrete Applied Mathematics 155 2007 945 970
14. M. Queyranne Structure of a simple scheduling polyhedron Mathematical Programming 58 1993 263 285
15. M. Queyranne, A.S. Schulz, Polyhedral approaches to machine scheduling, Working paper, 2004.
16. T.A. Roemer A note on the complexity of the concurrent open shop problem Journal of Scheduling 9 2006 389 396
17. A.S. Schulz Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds W.H. Cunningham, S.T. McCormick, M. Queyranne, Integer Programming and Combinatorial Optimization, IPCO 1996 Lecture Notes in Computer Science vol. 1084 1996 Springer Berlin 301 315
18. W.E. Smith Various optimizers for single-stage production Naval Research Logistics Quarterly 3 1956 59 66
19. C.S. Sung, and S.H. Yoon Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines International Journal of Production Economics 54 1998 247 255
20. E. Wagneur, and C. Sriskandarajah Open shops with jobs overlap European Journal of Operational Research 71 1993 366 378
21. G. Wang, T.C.E. Cheng, Customer order scheduling to minimize total weighted completion time, in: Proceedings of the First Multidisciplinary Conference on Scheduling Theory and Applications, 2003, pp. 409416.
22. L.A. Wolsey Mixed integer programming formulations for production planning and scheduling problems Invited Talk at the 12th International Symposium on Mathematical Programming 1985 MIT Cambridge, MA
23. J. Yang, Scheduling with batch objectives, Ph.D. Thesis, Industrial and Systems Engineering, The Ohio State University, 1998.