{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:17:41Z","timestamp":1759666661199,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T00:00:00Z","timestamp":1470614400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["KN 512\/7-1"],"award-info":[{"award-number":["KN 512\/7-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/K041274\/1"],"award-info":[{"award-number":["EP\/K041274\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10951-016-0490-0","type":"journal-article","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T07:45:53Z","timestamp":1470642353000},"page":"557-581","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Open Shop Scheduling with Synchronization"],"prefix":"10.1007","volume":"20","author":[{"given":"C.","family":"Wei\u00df","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Waldherr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Knust","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. V.","family":"Shakhlevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,8]]},"reference":[{"key":"490_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(93)E0121-E","volume":"58","author":"WW Bein","year":"1995","unstructured":"Bein, W. W., Brucker, P., Park, J. K., & Pathak, P. K. (1995). A Monge property for the \n                        $$d$$\n                        \n                            \n                                            \n                                d\n                            \n                        \n                    -dimensional transportation problem. Discrete Applied Mathematics, 58, 97\u2013109.","journal-title":"Discrete Applied Mathematics"},{"key":"490_CR2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.ijpe.2007.02.026","volume":"111","author":"N Boysen","year":"2008","unstructured":"Boysen, N., Fliedner, M., & Scholl, A. (2008). Assembly line balancing: Which model to use when? International Journal of Production Economics, 111, 509\u2013528.","journal-title":"International Journal of Production Economics"},{"key":"490_CR3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R","volume":"1","author":"P Brucker","year":"1998","unstructured":"Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M. Y., Potts, C. N., & Tautenhahn, T. (1998). Scheduling a batching machine. Journal of Scheduling, 1, 31\u201354.","journal-title":"Journal of Scheduling"},{"key":"490_CR4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0166-218X(95)00103-X","volume":"70","author":"RE Burkard","year":"1996","unstructured":"Burkard, R. E., Klinz, B., & Rudolf, R. (1996). Perspectives of Monge properties in optimization. Discrete Applied Mathematics, 70, 95\u2013161.","journal-title":"Discrete Applied Mathematics"},{"key":"490_CR5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1080\/00207543.2011.571460","volume":"50","author":"W-C Chiang","year":"2012","unstructured":"Chiang, W.-C., Urban, T. L., & Xu, X. (2012). A bi-objective metaheuristic approach to unpaced synchronous production line-balancing problems. International Journal of Production Research, 50, 293\u2013306.","journal-title":"International Journal of Production Research"},{"key":"490_CR6","unstructured":"\u0106usti\u0107, A., Klinz, B., & Woeginger, G. J. (2014). Planar 3-dimensional assignment problems with Monge-like cost arrays. E-print. \n                        arXiv:1405.5210\n                        \n                    ."},{"key":"490_CR7","doi-asserted-by":"crossref","unstructured":"de Werra, D., Demange, M., Escoffier, B., Monnot, J., & Paschos, V. T. (2009). Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Discrete Applied Mathematics, 157, 819\u2013832.","DOI":"10.1016\/j.dam.2008.06.013"},{"key":"490_CR8","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s002360050058","volume":"33","author":"VG Deineko","year":"1996","unstructured":"Deineko, V. G., Rudolf, R., & Woeginger, G. J. (1996). On the recognition of permuted Supnick and incomplete Monge matrices. Acta Informatica, 33, 559\u2013569.","journal-title":"Acta Informatica"},{"key":"490_CR9","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-36379-3_11","volume":"2573","author":"M Demange","year":"2002","unstructured":"Demange, M., de Werra, D., Monnot, J., & Paschos, V. T. (2002). Weighted node coloring: When stable sets are expensive. Lecture Notes in Computer Science, 2573, 114\u2013125.","journal-title":"Lecture Notes in Computer Science"},{"key":"490_CR10","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1287\/mnsc.46.3.421.12064","volume":"46","author":"KH Doerr","year":"2000","unstructured":"Doerr, K. H., Klastorin, T. D., & Magazine, M. J. (2000). Synchronous unpaced flow lines with worker differences and overtime cost. Management Science, 46, 421\u2013435.","journal-title":"Management Science"},{"key":"490_CR11","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.ipl.2005.09.013","volume":"97","author":"B Escoffier","year":"2006","unstructured":"Escoffier, B., Monnot, J., & Pashos, V. T. (2006). Weighted coloring: Further complexity and approximability results. Information Processing Letters, 97, 98\u2013103.","journal-title":"Information Processing Letters"},{"key":"490_CR12","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman."},{"key":"490_CR13","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T Gonzalez","year":"1976","unstructured":"Gonzalez, T., & Sahni, S. (1976). Open shop scheduling to minimize finish time. Journal of the ACM, 23, 665\u2013679.","journal-title":"Journal of the ACM"},{"key":"490_CR14","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1109\/TCOM.1985.1096336","volume":"33","author":"IS Gopal","year":"1985","unstructured":"Gopal, I. S., & Wong, C. K. (1985). Minimising the number of switchings in an SS\/TDMA system. IEEE Transactions on Communications, 33, 497\u2013501.","journal-title":"IEEE Transactions on Communications"},{"key":"490_CR15","unstructured":"Huang, K.-L. (2008). Flow shop scheduling with synchronous and asynchronous transportation times. Ph.D. Thesis, The Pennsylvania State University."},{"key":"490_CR16","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1109\/TCOMM.2007.898848","volume":"55","author":"A Kesselman","year":"2007","unstructured":"Kesselman, A., & Kogan, K. (2007). Nonpreemtive scheduling of optical switches. IEEE Transactions on Communications, 55, 1212\u20131219.","journal-title":"IEEE Transactions on Communications"},{"key":"490_CR17","first-page":"709","volume":"31","author":"P Kouvelis","year":"1999","unstructured":"Kouvelis, P., & Karabati, S. (1999). Cyclic scheduling in synchronous production lines. IIE Transactions, 31, 709\u2013719.","journal-title":"IIE Transactions"},{"key":"490_CR18","doi-asserted-by":"crossref","first-page":"1871","DOI":"10.1007\/978-1-4419-7997-1_32","volume-title":"Handbook of Combinatorial Optimization","author":"J Mestre","year":"2013","unstructured":"Mestre, J., & Raman, R. (2013). Max-Coloring. In P. M. Pardalos, D.-Z. Du, & R. L. Graham (Eds.), Handbook of Combinatorial Optimization (pp. 1871\u20131911). New York: Springer."},{"key":"490_CR19","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1287\/moor.23.4.892","volume":"23","author":"M Queyranne","year":"1998","unstructured":"Queyranne, M., Spieksma, F., & Tardella, F. (1998). A general class of greedily solvable linear programs. Mathematics of Operations Research, 23, 892\u2013908.","journal-title":"Mathematics of Operations Research"},{"key":"490_CR20","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0167-6377(85)90042-2","volume":"4","author":"F Rendl","year":"1985","unstructured":"Rendl, F. (1985). On the complexity of decomposing matrices arising in satellite communication. Operations Research Letters, 4, 5\u20138.","journal-title":"Operations Research Letters"},{"key":"490_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01919082","volume":"28","author":"H R\u00f6ck","year":"1984","unstructured":"R\u00f6ck, H. (1984). Some new results in flow shop scheduling. Mathematical Methods of Operations Research, 28, 1\u201316.","journal-title":"Mathematical Methods of Operations Research"},{"key":"490_CR22","doi-asserted-by":"crossref","first-page":"3311","DOI":"10.1080\/00207540600621672","volume":"45","author":"B Soylu","year":"2007","unstructured":"Soylu, B., Kirca, \u00d6., & Azizo\u011flu, M. (2007). Flow shop-sequencing problem with synchronous transfers and makespan minimization. International Journal of Production Research, 45, 3311\u20133331.","journal-title":"International Journal of Production Research"},{"key":"490_CR23","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1016\/j.ejor.2015.07.015","volume":"248","author":"TL Urban","year":"2016","unstructured":"Urban, T. L., & Chiang, W.-C. (2016). Designing energy-efficient serial production lines: The unpaced synchronous line-balancing problem. European Journal of Operational research, 248, 789\u2013801.","journal-title":"European Journal of Operational research"},{"key":"490_CR24","doi-asserted-by":"crossref","first-page":"4078","DOI":"10.1080\/00207543.2013.809495","volume":"52","author":"S Waldherr","year":"2014","unstructured":"Waldherr, S., & Knust, S. (2014). Two-stage scheduling in shelf-board production: a case study. International Journal of Production Research, 52, 4078\u20134092.","journal-title":"International Journal of Production Research"},{"key":"490_CR25","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.ejor.2014.09.053","volume":"242","author":"S Waldherr","year":"2015","unstructured":"Waldherr, S., & Knust, S. (2015). Complexity results for flow shop problems with synchronous movement. European Journal of Operational Research, 242, 34\u201344.","journal-title":"European Journal of Operational Research"},{"key":"490_CR26","unstructured":"Waldherr, S., Knust, S., & Briskorn, D. (2015). Synchronous flow shop probles: How much can we gain by leaving machines idle? (under submission)."},{"key":"490_CR27","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.dam.2016.04.019","volume":"211","author":"C Wei\u00df","year":"2016","unstructured":"Wei\u00df, C., Knust, S., Shakhlevich, N. V., & Waldherr, S. (2016). The assignment problem with nearly Monge arrays and incompatible partner indices. Discrete Applied Mathematics, 211, 183\u2013203.","journal-title":"Discrete Applied Mathematics"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-016-0490-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0490-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0490-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0490-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,21]],"date-time":"2017-11-21T09:29:53Z","timestamp":1511256593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-016-0490-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,8]]},"references-count":27,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["490"],"URL":"https:\/\/doi.org\/10.1007\/s10951-016-0490-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2016,8,8]]}}}