1. R.H. Ahmadi, U. Bagchi, T.A. Roemer, Coordinated scheduling of customer orders for quick response. Naval Res. Logist.52, 483–512 (2005)

   Google Scholar 

2. R.H. Ahmadi, U. Bagchi,Scheduling of Multi-Job Customer Orders in Multimachine Environments (ORSA/TIMS, Philadelphia, 1990)

   Google Scholar 

3. N. Bansal, S. Khot, Inapproximability of hypergraph vertex cover and applications to scheduling problems, inAutomata, Languages and Programming. ICALP 2010, ed. by S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis. Lecture Notes in Computer Science, vol. 6198 (Springer, Berlin, 2010), pp. 250–261

   Google Scholar 

4. Z.L. Chen, N.G. Hall, Supply chain scheduling: assembly systems. Working paper, Department of Systems Engineering, University of Pennsylvania, 2001

   Google Scholar 

5. T.C.E. Cheng, Q. Nong, C.T. Ng, Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time. Naval Res. Logist.58, 763–770 (2011)

   Google Scholar 

6. T.C.E. Cheng, G. Wang, Customer order scheduling on multiple facilities. Working paper no. 11/98-9, Faculty of Business and Information Systems, The Hong Kong Polytechnic University, 1999

   Google Scholar 

7. I. Dinur, V. Guruswami, S. Khot, O. Regev, A new multilayered PCP and the hardness of hypergraph vertex cover. SIAM J. Comput.34, 1129–1146 (2005)

   Google Scholar 

8. I. Dinur, D. Steurer, Analytical approach to parallel repetition, inProceedings of the 2014 ACM symposium on Theory of Computing. STOC’14 (ACM, Berlin, 2014), pp. 624–633

   Google Scholar 

9. U. Feige, A threshold of\(\ln n\) for aproximating set cover. J. ACM45, 634–652 (1998)

   Google Scholar 

10. J.M. Framinan, P. Perez-Gonzalez, Order scheduling with tardiness objective: improved approximate solutions. Eur. J. Oper. Res.266, 840–850 (2018)

    Google Scholar 

11. J.M. Framinan, P. Perez-Gonzalez, V. Fernandez-Viagas, Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures. Eur. J. Oper. Res.273, 401–417 (2019)

    Google Scholar 

12. M.R. Garey, D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, San Francisco, 1979)

    Google Scholar 

13. N. Garg, A. Kumar, V. Pandit, Order scheduling models: hardness and algorithms, inLecture Notes in Computer Science 4855 (Springer, Berlin, 2007), pp. 96–107

    Google Scholar 

14. R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discr. Math.5, 287–326 (1979)

    Google Scholar 

15. T. Grinshpoun, H. Ilani, E. Shufan, The representation of partially-concurrent open shop problems. Ann. Oper. Res.252, 455–469 (2017)

    Google Scholar 

16. H. Ilani, E. Shufan, T. Grinshpoun, Partially concurrent open shop scheduling with integral preemtions. Ann. Oper. Res.259, 157–171 (2017)

    Google Scholar 

17. J.R. Jackson, Scheduling a production line to minimize maximum tardiness. Management science research project, research report 43, UCLA, 1955

    Google Scholar 

18. S. Khot, On the power of unique 2-prover 1-round games, inProceedings pf the 34th Annual ACM Symposium on Theory of Computing (2002), pp. 767–775

    Google Scholar 

19. J.Y.-T. Leung, H. Li, M. Pinedo, Scheduling orders for multiple product types with due date related objectives. Eur. J. Oper. Res.168, 370–389 (2006)

    Google Scholar 

20. M. Mastrolilli, M. Queyranne, A.S. Schulz, O. Svensson, N.A. Uhan, Minimizing the sum of weighted completion times in a concurrent open shop. Oper. Res. Lett.38, 390–395 (2010)

    Google Scholar 

21. J.M. Moore, Ann job, one machine sequencing algorithm for minimizing the number of late jobs. Manag. Sci.15, 102–109 (1968)

    Google Scholar 

22. C.T. Ng, T.C.E. Cheng, J.J. Yuan, Concurrent open shop scheduling to minimize the weighted number of tardy jobs. J. Sched.6, 405–412 (2003)

    Google Scholar 

23. T.A. Roemer, A note on establishing heuristic bounds by instance construction. Technical report, Sloan School at MIT, Cambridge, MA, 2004

    Google Scholar 

24. T.A. Roemer, A note on the complexity of the concurrent open shop scheduling problem. J. Sched.9, 389–396 (2006)

    Google Scholar 

25. A.S. Schulz, Scheduling to minimize total weighted completion time: performance guarantees of lp-based heuristics and lower bounds, inInteger Programming and Combinatorial Optimization, IPCO 1996, ed. by W.H. Cunningham, S.T. McCormick, M. Queyranne. Lecture Notes in Computer Science (Springer, Berlin, 1996), pp. 301–315

    Google Scholar 

26. E. Wagneur, C. Sriskandarajah, Open shops with jobs overlap. Eur. J. Oper. Res.71, 366–378 (1993)

    Google Scholar 

Download references