{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:34Z","timestamp":1740123214151,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100011019","name":"National Research, Development and Innovation Office","doi-asserted-by":"crossref","award":["112881"],"award-info":[{"award-number":["112881"]}],"id":[{"id":"10.13039\/501100011019","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Ministry of National Economics","award":["GINOP-2.3.2- 15-2016-00002"],"award-info":[{"award-number":["GINOP-2.3.2- 15-2016-00002"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10479-019-03180-8","type":"journal-article","created":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T11:23:47Z","timestamp":1551439427000},"page":"283-322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Polyhedral results for position-based scheduling of chains on a single machine"],"prefix":"10.1007","volume":"284","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1062-6272","authenticated-orcid":false,"given":"Mark\u00f3","family":"Horv\u00e1th","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2759-1264","authenticated-orcid":false,"given":"Tam\u00e1s","family":"Kis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,1]]},"reference":[{"issue":"3","key":"3180_CR1","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1057\/palgrave.jors.2601689","volume":"55","author":"A Bachman","year":"2004","unstructured":"Bachman, A., & Janiak, A. (2004). Scheduling jobs with position-dependent processing times. Journal of the Operational Research Society, 55(3), 257\u2013264.","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"3180_CR2","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"EG Coffman","year":"1972","unstructured":"Coffman, E. G., & Graham, R. L. (1972). Optimal scheduling for two-processor systems. Acta Informatica, 1(3), 200\u2013213.","journal-title":"Acta Informatica"},{"key":"3180_CR3","volume-title":"Integer programming, volume 271 of graduate texts in mathematics","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., & Zambelli, G. (2014). Integer programming, volume 271 of graduate texts in mathematics. Berlin: Springer."},{"key":"3180_CR4","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"2","key":"3180_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1287\/ijoc.13.2.157.10520","volume":"13","author":"H Hoogeveen","year":"2001","unstructured":"Hoogeveen, H., Schuurman, P., & Woeginger, G. J. (2001). Non-approximability results for scheduling problems with minsum criteria. INFORMS Journal on Computing, 13(2), 157\u2013168.","journal-title":"INFORMS Journal on Computing"},{"issue":"6","key":"3180_CR6","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1287\/opre.9.6.841","volume":"9","author":"TC Hu","year":"1961","unstructured":"Hu, T. C. (1961). Parallel sequencing and assembly line problems. Operations Research, 9(6), 841\u2013848.","journal-title":"Operations Research"},{"issue":"2","key":"3180_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0012-365X(75)90003-5","volume":"11","author":"RG Jeroslow","year":"1975","unstructured":"Jeroslow, R. G. (1975). On defining sets of vertices of the hypercube by linear inequalities. Discrete Mathematics, 11(2), 119\u2013124.","journal-title":"Discrete Mathematics"},{"issue":"6","key":"3180_CR8","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.orl.2004.11.009","volume":"33","author":"B Johannes","year":"2005","unstructured":"Johannes, B. (2005). On the complexity of scheduling unit-time jobs with or-precedence constraints. Operations Research Letters, 33(6), 587\u2013596.","journal-title":"Operations Research Letters"},{"issue":"1\u20132","key":"3180_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H. W. (1955). The hungarian method for the assignment problem. Naval Research Logistics, 2(1\u20132), 83\u201397.","journal-title":"Naval Research Logistics"},{"key":"3180_CR10","unstructured":"Kulkarni, J., & Munagala, K. (2012). Algorithms for cost-aware scheduling. In International workshop on approximation and online algorithms (pp. 201\u2013214). Springer, Berlin."},{"key":"3180_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63976-5","volume-title":"Compact extended linear programming models","author":"G Lancia","year":"2018","unstructured":"Lancia, G., & Serafini, P. (2018). Compact extended linear programming models. Berlin: Springer."},{"key":"3180_CR12","first-page":"75","volume-title":"Annals of discrete mathematics","author":"EL Lawler","year":"1978","unstructured":"Lawler, E. L. (1978). Sequencing jobs to minimize total weighted completion time subject to precedence constraints. In B. Alspach, P. Hell, & D. J. Miller (Eds.), Annals of discrete mathematics (Vol. 2, pp. 75\u201390). Amsterdam: Elsevier."},{"issue":"1","key":"3180_CR13","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"JK Lenstra","year":"1978","unstructured":"Lenstra, J. K., & Rinnooy Kan, A. (1978). Complexity of scheduling under precedence constraints. Operations Research, 26(1), 22\u201335.","journal-title":"Operations Research"},{"issue":"4","key":"3180_CR14","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0377-2217(80)90111-3","volume":"4","author":"JK Lenstra","year":"1980","unstructured":"Lenstra, J. K., & Rinnooy Kan, A. (1980). Complexity results for scheduling chains on a single machine. European Journal of Operational Research, 4(4), 270\u2013275.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"3180_CR15","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/ijoc.2.4.346","volume":"2","author":"JY-T Leung","year":"1990","unstructured":"Leung, J. Y.-T., & Young, G. H. (1990). Minimizing total tardiness on a single machine with precedence constraints. ORSA Journal on Computing, 2(4), 346\u2013352.","journal-title":"ORSA Journal on Computing"},{"issue":"2","key":"3180_CR16","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1137\/S009753970037727X","volume":"33","author":"RH M\u00f6hring","year":"2004","unstructured":"M\u00f6hring, R. H., Skutella, M., & Stork, F. (2004). Scheduling with and\/or precedence constraints. SIAM Journal on Computing, 33(2), 393\u2013415.","journal-title":"SIAM Journal on Computing"},{"key":"3180_CR17","volume-title":"Integer programming and combinatorial optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G. L., & Wolsey, L. A. (1988). Integer programming and combinatorial optimization. Chichester: Wiley."},{"issue":"1","key":"3180_CR18","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10479-012-1098-1","volume":"196","author":"R Rudek","year":"2012","unstructured":"Rudek, R. (2012). Scheduling problems with position dependent job processing times: Computational complexity results. Annals of Operations Research, 196(1), 491\u2013516.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"3180_CR19","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0377-2217(02)00767-1","volume":"149","author":"VG Timkovsky","year":"2003","unstructured":"Timkovsky, V. G. (2003). Identical parallel machines versus unit-time shops and preemptions versus chains in scheduling complexity. European Journal of Operational Research, 149(2), 355\u2013376.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"3180_CR20","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"JD Ullman","year":"1975","unstructured":"Ullman, J. D. (1975). Np-complete scheduling problems. Journal of Computer and System sciences, 10(3), 384\u2013393.","journal-title":"Journal of Computer and System sciences"},{"issue":"2","key":"3180_CR21","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/nav.20393","volume":"57","author":"G Wan","year":"2010","unstructured":"Wan, G., & Qi, X. (2010). Scheduling with variable time slot costs. Naval Research Logistics (NRL), 57(2), 159\u2013171.","journal-title":"Naval Research Logistics (NRL)"},{"issue":"6","key":"3180_CR22","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s10951-015-0462-9","volume":"19","author":"Y Zhao","year":"2016","unstructured":"Zhao, Y., Qi, X., & Li, M. (2016). On scheduling with non-increasing time slot cost to minimize total weighted completion time. Journal of Scheduling, 19(6), 759\u2013767.","journal-title":"Journal of Scheduling"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03180-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-019-03180-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03180-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,29]],"date-time":"2020-11-29T00:50:03Z","timestamp":1606611003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-019-03180-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["3180"],"URL":"https:\/\/doi.org\/10.1007\/s10479-019-03180-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2019,3,1]]},"assertion":[{"value":"1 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}