{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:58:27Z","timestamp":1762271907413},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,6,30]],"date-time":"2015-06-30T00:00:00Z","timestamp":1435622400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10479-015-1934-1","type":"journal-article","created":{"date-parts":[[2015,6,29]],"date-time":"2015-06-29T15:55:14Z","timestamp":1435593314000},"page":"455-469","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The representation of partially-concurrent open shop problems"],"prefix":"10.1007","volume":"252","author":[{"given":"Tal","family":"Grinshpoun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hagai","family":"Ilani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elad","family":"Shufan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,30]]},"reference":[{"issue":"1","key":"1934_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10479-012-1075-8","volume":"196","author":"M Andresen","year":"2012","unstructured":"Andresen, M., & Dhamala, T. N. (2012). New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan. Annals of Operations Research, 196(1), 1\u201326.","journal-title":"Annals of Operations Research"},{"issue":"7","key":"1934_CR2","doi-asserted-by":"publisher","first-page":"1279","DOI":"10.1016\/j.mcm.2008.01.002","volume":"48","author":"M Andresen","year":"2008","unstructured":"Andresen, M., Br\u00e4sel, H., M\u00f6rig, M., Tusch, J., Werner, F., & Willenius, P. (2008). Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop. Mathematical and Computer Modelling, 48(7), 1279\u20131293.","journal-title":"Mathematical and Computer Modelling"},{"key":"1934_CR3","volume-title":"Digraphs: Theory, algorithms and applications","author":"J Bang-Jensen","year":"2008","unstructured":"Bang-Jensen, J., & Gutin, G. Z. (2008). Digraphs: Theory, algorithms and applications. Berlin: Springer."},{"issue":"1","key":"1934_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0020-0190(99)00120-9","volume":"72","author":"VC Barbosa","year":"1999","unstructured":"Barbosa, V. C., & Szwarcfiter, J. L. (1999). Generating all the acyclic orientations of an undirected graph. Information Processing Letters, 72(1), 71\u201374.","journal-title":"Information Processing Letters"},{"key":"1934_CR5","doi-asserted-by":"publisher","unstructured":"Br\u00e4sel, H. (2006). Matrices in shop scheduling problems. In M. Morlock, C. Schwindt, N. Trautmann & J. Zimmermann (Eds.), Perspectives on operations research (pp. 17\u201341). Berlin: Springer.","DOI":"10.1007\/978-3-8350-9064-4_2"},{"issue":"3","key":"1934_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1080\/02331939208843762","volume":"23","author":"H Br\u00e4sel","year":"1992","unstructured":"Br\u00e4sel, H., & Kleinau, M. (1992). On the number of feasible schedules of the open-shop-problem\u2014an application of special latin rectangles. Optimization, 23(3), 251\u2013260.","journal-title":"Optimization"},{"issue":"2","key":"1934_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF01680372","volume":"43","author":"H Br\u00e4sel","year":"1996","unstructured":"Br\u00e4sel, H., & Kleinau, M. (1996). New steps in the amazing world of sequences and schedules. Mathematical Methods of Operations Research, 43(2), 195\u2013214.","journal-title":"Mathematical Methods of Operations Research"},{"issue":"2","key":"1934_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02243845","volume":"51","author":"H Br\u00e4sel","year":"1993","unstructured":"Br\u00e4sel, H., Tautenhahn, T., & Werner, F. (1993). Constructive heuristic algorithms for the open shop problem. Computing, 51(2), 95\u2013110.","journal-title":"Computing"},{"issue":"1","key":"1934_CR9","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(93)E0156-S","volume":"59","author":"H Br\u00e4sel","year":"1995","unstructured":"Br\u00e4sel, H., Kluge, D., & Werner, F. (1995). A polynomial algorithm for an open shop problem with unit processing times and tree constraints. Discrete Applied Mathematics, 59(1), 11\u201321.","journal-title":"Discrete Applied Mathematics"},{"key":"1934_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018938915709","volume":"92","author":"H Br\u00e4sel","year":"1999","unstructured":"Br\u00e4sel, H., Harborth, M., Tautenhahn, T., & Willenius, P. (1999). On the set of solutions of the open shop problem. Annals of Operations Research, 92, 241\u2013263.","journal-title":"Annals of Operations Research"},{"key":"1934_CR11","first-page":"115","volume":"37","author":"H Br\u00e4sel","year":"2001","unstructured":"Br\u00e4sel, H., Harborth, M., & Willenius, P. (2001). Isomorphism for digraphs and sequences of shop scheduling problems. Journal of Combinatorial Mathematics and Combinatorial Computing, 37, 115\u2013128.","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"1934_CR12","unstructured":"Castillo-Salazar, J. A., Landa-Silva, D., & Qu, R. (2012). A survey on workforce scheduling and routing problems. In Proceedings of the 9th international conference on the practice and theory of automated timetabling (pp. 283\u2013302)."},{"key":"1934_CR13","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1977","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. (1977). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"11","key":"1934_CR14","first-page":"987","volume":"29","author":"R Kolisch","year":"1997","unstructured":"Kolisch, R., & Drexl, A. (1997). Local search for nonpreemptive multi-mode resource-constrained project scheduling. IIE Transactions, 29(11), 987\u2013999.","journal-title":"IIE Transactions"},{"issue":"5","key":"1934_CR15","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10951-005-2860-x","volume":"8","author":"JYT Leung","year":"2005","unstructured":"Leung, J. Y. T., Li, H., & Pinedo, M. (2005). Order scheduling in an environment with dedicated resources in parallel. Journal of Scheduling, 8(5), 355\u2013386.","journal-title":"Journal of Scheduling"},{"issue":"5","key":"1934_CR16","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.orl.2010.04.011","volume":"38","author":"M Mastrolilli","year":"2010","unstructured":"Mastrolilli, M., Queyranne, M., Schulz, A. S., Svensson, O., & Uhan, N. A. (2010). Minimizing the sum of weighted completion times in a concurrent open shop. Operations Research Letters, 38(5), 390\u2013395.","journal-title":"Operations Research Letters"},{"issue":"1","key":"1934_CR17","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.cor.2009.04.010","volume":"37","author":"B Naderi","year":"2010","unstructured":"Naderi, B., Fatemi Ghomi, S., Aminnayeri, M., & Zandieh, M. (2010). A contribution and new heuristics for open shop scheduling. Computers & Operations Research, 37(1), 213\u2013221.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"1934_CR18","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1023\/A:1024284828374","volume":"6","author":"CT Ng","year":"2003","unstructured":"Ng, C. T., Cheng, T. C. E., & Yuan, J. J. (2003). Concurrent open shop scheduling to minimize the weighted number of tardy jobs. Journal of Scheduling, 6(4), 405\u2013412.","journal-title":"Journal of Scheduling"},{"key":"1934_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: Theory, algorithms, and systems","author":"M Pinedo","year":"2012","unstructured":"Pinedo, M. (2012). Scheduling: Theory, algorithms, and systems. Berlin: Springer."},{"issue":"4","key":"1934_CR20","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10951-006-7042-y","volume":"9","author":"TA Roemer","year":"2006","unstructured":"Roemer, T. A. (2006). A note on the complexity of the concurrent open shop problem. Journal of Scheduling, 9(4), 389\u2013396.","journal-title":"Journal of Scheduling"},{"issue":"5","key":"1934_CR21","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.cor.2011.07.006","volume":"39","author":"K Smith-Miles","year":"2012","unstructured":"Smith-Miles, K., & Lopes, L. (2012). Measuring instance difficulty for combinatorial optimization problems. Computers & Operations Research, 39(5), 875\u2013889.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"1934_CR22","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278\u2013285.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"1934_CR23","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1016\/0377-2217(93)90347-P","volume":"71","author":"E Wagneur","year":"1993","unstructured":"Wagneur, E., & Sriskandarajah, C. (1993). Openshops with jobs overlap. European Journal of Operational Research, 71(3), 366\u2013378.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1934-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-1934-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1934-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1934-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:10:00Z","timestamp":1559139000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-1934-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,30]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["1934"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-1934-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,30]]}}}