{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:41:25Z","timestamp":1773326485741,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T00:00:00Z","timestamp":1154390400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2006,8]]},"DOI":"10.1007\/s10951-006-7042-y","type":"journal-article","created":{"date-parts":[[2006,5,11]],"date-time":"2006-05-11T13:45:07Z","timestamp":1147355107000},"page":"389-396","source":"Crossref","is-referenced-by-count":64,"title":["A note on the complexity of the concurrent open shop problem"],"prefix":"10.1007","volume":"9","author":[{"given":"Thomas A.","family":"Roemer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7042_CR1","volume-title":"Scheduling of Multi-Job Customer Orders in Multi-Machine Environments","author":"R. H. Ahmadi","year":"1990","unstructured":"Ahmadi, R. H. and U. Bagchi, \u201cScheduling of Multi-Job Customer Orders in Multi-Machine Environments,\u201d ORSA\/TIMS, Philadelphia, 1990."},{"key":"7042_CR2","unstructured":"Ahmadi, R. H. and U. Bagchi, \u201cCoordinated Scheduling of Customer Orders,\u201d Working Paper, Anderson School at UCLA (1993)."},{"key":"7042_CR3","unstructured":"Ahmadi, R. H. and U. Bagchi, \u201cCoordinated Scheduling of Customer Orders,\u201d updated Working Paper, Anderson School at UCLA (1997)."},{"key":"7042_CR4","doi-asserted-by":"crossref","unstructured":"Ahmadi, R. H., U. Bagchi, and T.A. Roemer, \u201cCoordinated Scheduling of Customer Orders for Quick Response,\u201d forthcoming in Naval Research Logistics (2006).","DOI":"10.1002\/nav.20092"},{"key":"7042_CR5","volume-title":"Introduction to sequencing and scheduling","author":"K. R. Baker","year":"1974","unstructured":"Baker, K. R., Introduction to sequencing and scheduling, Wiley, New York 1974."},{"key":"7042_CR6","unstructured":"Chen Z. L. and N. G. Hall, \u201cSupply chain scheduling: Assembly systems,\u201d Working Paper, Department of Systems Engineering, University of Pennsylvania 2000."},{"key":"7042_CR7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, \u201cOptimization and Approximation in Deterministic Sequencing and Scheduling: A Survey,\u201d Annals of Discrete Mathematics, 5, 287\u2013326 1979.","journal-title":"Annals of Discrete Mathematics"},{"issue":"5","key":"7042_CR8","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1287\/mnsc.39.5.616","volume":"39","author":"C.-Y. Lee","year":"1993","unstructured":"Lee, C.-Y., T. C. E. Cheng, and B. M. T. Lin, \u201cMinimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem,\u201d Management Science, 39(5), 616\u2013625 1993.","journal-title":"Management Science"},{"key":"7042_CR9","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10951-005-2860-x","volume":"8","author":"J.Y.-T. Leung","year":"2005a","unstructured":"Leung, J.Y.-T, H. Li, and M. Pinedo, \u201cOrder Scheduling in an Environment with Dedicated Resources in Parallel,\u201d Journal of Scheduling, 8, 355\u2013386 2005a.","journal-title":"Journal of Scheduling"},{"key":"7042_CR10","unstructured":"Leung, J.Y.-T, H. Li, and M. Pinedo, \u201cScheduling Orders for Multiple Product Types to Minimize Total Weighted Completion Time,\u201d Working Paper 2005b."},{"key":"7042_CR11","volume-title":"Multidisciplinary scheduling: Theory and applications","author":"J.Y.-T. Leung","year":"2005c","unstructured":"Leung, J.Y.-T, H. Li, and M. Pinedo, \u201cOrder Scheduling Models: An Overview,\u201d In Multidisciplinary scheduling: Theory and applications , G. Kendall, E. K. Burke, S. Petrovic and M. Gendreau (eds.), Springer, New York, 2005c."},{"key":"7042_CR12","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1016\/j.ejor.2003.11.023","volume":"163","author":"J.Y.-T. Leung","year":"2005","unstructured":"Leung, J.Y.-T, H. Li, M. Pinedo and C. Sriskandarajah, \u201cOpen shops with jobs overlap\u2014revisited,\u201d European Journal of Operational Research, 163, 569\u2013571 2005.","journal-title":"European Journal of Operational Research"},{"key":"7042_CR13","volume-title":"Heuristic Scheduling System","author":"T. E. Morton","year":"1993","unstructured":"Morton, T. E. and D. W. Pentico, Heuristic Scheduling System, Wiley, New York (1993)."},{"key":"7042_CR14","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1023\/A:1024284828374","volume":"6","author":"C.T. Ng","year":"2003","unstructured":"Ng, C.T., T. C. E. Cheng, and J. J. Yuan, \u201cConcurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs,\u201d Journal of Scheduling, 6, 405\u2013412 (2003).","journal-title":"Journal of Scheduling"},{"key":"7042_CR15","volume-title":"Scheduling: Theory, algorithms and systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo, M., Scheduling: Theory, algorithms and systems, Prentice Hall, Englewood Cliffs, NJ (2002)."},{"issue":"2","key":"7042_CR16","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1287\/opre.43.2.346","volume":"43","author":"C. N. Potts","year":"1995","unstructured":"Potts, C. N., S. V. Sevast Janov, V. A. Strusevich, L. N. Van Wassenhove and C. M. Zwaneveld, \u201cThe Two-Stage Assembly Scheduling Problem: Complexity and approximations,\u201d Operations Research, 43(2), 346\u2013355 1995.","journal-title":"Operations Research"},{"key":"7042_CR17","unstructured":"Roemer, T. A. and R. Ahmadi, \u201cThe Complexity of Scheduling Customer Orders,\u201d Working Paper, Anderson School at UCLA (1997a)."},{"key":"7042_CR18","unstructured":"Roemer, T. A. and R. Ahmadi, \u201cThe Complexity of Scheduling Customer Orders,\u201d INFORMS, Dallas (1997b)."},{"key":"7042_CR19","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0925-5273(97)00151-5","volume":"54","author":"C. S. Sung","year":"1998","unstructured":"Sung, C. S. and S. H. Yoon, \u201cMinimizing total weighted completion time at a pre-assembly stage composed of two feeding machines,\u201d International Journal of Production Economics, 54, 247\u2013255 (1998).","journal-title":"International Journal of Production Economics"},{"key":"7042_CR20","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/0377-2217(93)90347-P","volume":"71","author":"E. Wagneur","year":"1993","unstructured":"Wagneur, E. and C. Sriskandarajah, \u201cOpen shops with jobs overlap,\u201d European Journal of Operational Research, 71, 366\u2013378 (1993).","journal-title":"European Journal of Operational Research"},{"key":"7042_CR21","unstructured":"Wang, G. and T. C. E. Cheng, \u201cCustomer Order Scheduling To Minimize Total Weighted Completion Time,\u201d In Proceedings of the first Multidisciplinary Conference on Scheduling Theory and Applications, 2003, pp. 409\u2013416."},{"key":"7042_CR22","doi-asserted-by":"crossref","first-page":"1921","DOI":"10.1016\/j.cor.2003.12.008","volume":"32","author":"J. Yang","year":"2005","unstructured":"Yang, J., \u201cThe complexity of customer order scheduling problems on parallel machines,\u201d Computers & Operations Research, 32, 1921\u20131939 2005.","journal-title":"Computers & Operations Research"},{"key":"7042_CR23","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10951-005-5315-5","volume":"8","author":"J. Yang","year":"2005","unstructured":"Yang, J. and M. E. Posner, \u201cScheduling Parallel Machines For The Customer Order Problem,\u201d Journal of Scheduling, 8, 49\u201374 (2005).","journal-title":"Journal of Scheduling"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-7042-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-006-7042-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-7042-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:39Z","timestamp":1559468379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-006-7042-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,8]]}},"alternative-id":["7042"],"URL":"https:\/\/doi.org\/10.1007\/s10951-006-7042-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8]]}}}