{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T13:09:33Z","timestamp":1712495373508},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,2,14]],"date-time":"2017-02-14T00:00:00Z","timestamp":1487030400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s10951-016-0507-8","type":"journal-article","created":{"date-parts":[[2017,2,14]],"date-time":"2017-02-14T07:50:17Z","timestamp":1487058617000},"page":"303-311","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays"],"prefix":"10.1007","volume":"20","author":[{"given":"Aur\u00e9lien","family":"Carlier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claire","family":"Hanen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alix Munier","family":"Kordon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,14]]},"reference":[{"issue":"6","key":"507_CR1","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1111\/j.1475-3995.2009.00758.x","volume":"17","author":"A Benabid","year":"2010","unstructured":"Benabid, A., & Hanen, C. (2010). Performance of Garey\u2013Johnson algorithm for pipelined type tasks systems. International Transactions on Operational Research, 17(6), 797\u2013808.","journal-title":"International Transactions on Operational Research"},{"issue":"4","key":"507_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s006070050036","volume":"63","author":"P Brucker","year":"1999","unstructured":"Brucker, P., & Knust, S. (1999). Complexity results for single-machine problems with positive finish-start time-lags. Computing, 63(4), 299\u2013316. doi:\n                        10.1007\/s006070050036\n                        \n                    .","journal-title":"Computing"},{"key":"507_CR3","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001). Introduction to algorithms (2nd ed.). Cambridge, MA: The MIT Press.","edition":"2"},{"key":"507_CR4","unstructured":"Dupont\u00a0de Dinechin, B. (2007). Scheduling monotone interval orders on typed task systems. In PLANSIG 2007, 26th Worshop of the UK Planning and Scheduling Special Interest Group (pp. 25\u201331)."},{"key":"507_CR5","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0206029","volume":"6","author":"MR Garey","year":"1977","unstructured":"Garey, M. R., & Johnson, D. S. (1977). Two-processor scheduling with start-time and deadlines. SIAM Journal on Computing, 6, 416\u2013426.","journal-title":"SIAM Journal on Computing"},{"key":"507_CR6","volume-title":"Computers and intractability: A guide to the theory of NP-completeness. Studienreihe Informatik","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. Studienreihe Informatik. San Francisco, CA: W.H. Freeman and Company."},{"key":"507_CR7","first-page":"453","volume":"2","author":"C Hanen","year":"2005","unstructured":"Hanen, C., & Zinder, Y. (2005). The worst case analysis of Garey\u2013Johnson algorithm for preemptive m processors. Multidisciplinary International Conference on Scheduling: Theory and Applications, 2, 453\u2013470.","journal-title":"Multidisciplinary International Conference on Scheduling: Theory and Applications"},{"issue":"4","key":"507_CR8","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10951-009-0101-4","volume":"12","author":"C Hanen","year":"2009","unstructured":"Hanen, C., & Zinder, Y. (2009). The worst-case analysis of the Garey\u2013Johnson algorithm. Journal of Scheduling, 12(4), 389\u2013400.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"507_CR9","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/2166.357217","volume":"5","author":"JL Hennessy","year":"1983","unstructured":"Hennessy, J. L., & Gross, T. (1983). Postpass code optimization of pipeline constraints. ACM Transactions on Programming Languages and Systems, 5(3), 422\u2013448. doi:\n                        10.1145\/2166.357217\n                        \n                    .","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"507_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/nav.3800210113","volume":"21","author":"W Horn","year":"1974","unstructured":"Horn, W. (1974). Some simple scheduling algorithms. Naval Research Logistics Quarterly, 21, 177\u2013185.","journal-title":"Naval Research Logistics Quarterly"},{"key":"507_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1051\/ro\/2013028","volume":"47","author":"AM Kordon","year":"2013","unstructured":"Kordon, A. M., Kacem, F., Dupont de Dinechin, B., & Finta, L. (2013). Scheduling an interval ordered precedence graph with communication delays and a limited number of processors. RAIRO\u2014Operations Research, 47, 73\u201387. doi:\n                        10.1051\/ro\/2013028\n                        \n                    .","journal-title":"RAIRO\u2014Operations Research"},{"key":"507_CR12","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume-title":"Studies in integer programming, annals of discrete mathematics","author":"J Lenstra","year":"1977","unstructured":"Lenstra, J., Kan, A. R., & Brucker, P. (1977). Complexity of machine scheduling problems. In B. K. P. L. Hammer, E. L. Johnson, & G. Nemhauser (Eds.), Studies in integer programming, annals of discrete mathematics (pp. 343\u2013362). Amsterdam: Elsevier. doi:\n                        10.1016\/S0167-5060(08)70743-X\n                        \n                    ."},{"key":"507_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/383721.383733","volume":"23","author":"A Leung","year":"2001","unstructured":"Leung, A., Palem, K. V., & Pnueli, A. (2001). Scheduling time-constrained instructions on pipelined processors. ACM Transactions on Programming Languages and Systems, 23, 73\u2013103. doi:\n                        10.1145\/383721.383733\n                        \n                    .","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"4","key":"507_CR14","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1145\/155183.155190","volume":"15","author":"KV Palem","year":"1993","unstructured":"Palem, K. V., & Simons, B. B. (1993). Scheduling time-critical instructions on risc machines. ACM Transactions on Programming Languages and Systems, 15(4), 632\u2013658. doi:\n                        10.1145\/155183.155190\n                        \n                    .","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"507_CR15","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. doi:\n                        10.1016\/S0022-0000(75)80008-0\n                        \n                    .","journal-title":"Journal of Computer and System Sciences"},{"issue":"5","key":"507_CR16","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1023\/B:JOSH.0000036858.59787.c2","volume":"7","author":"W Yu","year":"2004","unstructured":"Yu, W., Hoogeveen, H., & Lenstra, J. K. (2004). Minimizing makespan in a two-machine flow shop with delays and unit-time operations is np-hard. Journal of Scheduling, 7(5), 333\u2013348.","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-016-0507-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-016-0507-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0507-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T10:15:35Z","timestamp":1493288135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-016-0507-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,14]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["507"],"URL":"https:\/\/doi.org\/10.1007\/s10951-016-0507-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,14]]}}}