{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T17:16:26Z","timestamp":1721063786238},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,1,16]],"date-time":"2016-01-16T00:00:00Z","timestamp":1452902400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"PHC van Gogh","award":["33669TC"],"award-info":[{"award-number":["33669TC"]}]},{"name":"Fondecyt","award":["11140566"],"award-info":[{"award-number":["11140566"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s10951-015-0466-5","type":"journal-article","created":{"date-parts":[[2016,1,16]],"date-time":"2016-01-16T02:44:59Z","timestamp":1452912299000},"page":"239-254","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The local\u2013global conjecture for scheduling with non-linear cost"],"prefix":"10.1007","volume":"20","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"D\u00fcrr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen\u00a0Kim","family":"Thang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00d3scar C.","family":"V\u00e1squez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,16]]},"reference":[{"issue":"2","key":"466_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1057\/jors.1993.24","volume":"44","author":"B Alidaee","year":"1993","unstructured":"Alidaee, B. (1993). Numerical methods for single machine scheduling with non-linear cost functions to minimize total cost. Journal of the Operational Research Society, 44(2), 125\u2013132.","journal-title":"Journal of the Operational Research Society"},{"issue":"6","key":"466_CR2","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1287\/mnsc.26.6.633","volume":"26","author":"P Bagga","year":"1980","unstructured":"Bagga, P., & Karlra, K. (1980). A node elimination procedure for Townsend\u2019s algorithm for solving the single machine quadratic penalty function scheduling problem. Management Science, 26(6), 633\u2013636.","journal-title":"Management Science"},{"key":"466_CR3","doi-asserted-by":"publisher","unstructured":"Bansal, N., & Pruhs, K. (2010). The geometry of scheduling. In Proceedings of the IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS) (pp. 407\u2013414).","DOI":"10.1109\/FOCS.2010.46"},{"key":"466_CR4","doi-asserted-by":"publisher","unstructured":"Cheung, M., & Shmoys, D. (2011). A primal-dual approximation algorithm for min-sum single-machine scheduling problems. In Proceedings of the 14th International Workshop APPROX and 15th International Workshop RANDOM (pp. 135\u2013146).","DOI":"10.1007\/978-3-642-22935-0_12"},{"key":"466_CR5","doi-asserted-by":"publisher","unstructured":"Croce, F., Tadei, R., Baracco, P., Di Tullio, R. (1993). On minimizing the weighted sum of quadratic completion times on a single machine. In Proceedings of the IEEE International Conference on Robotics and Automation (pp. 816\u2013820).","DOI":"10.1109\/ROBOT.1993.292245"},{"key":"466_CR6","doi-asserted-by":"publisher","unstructured":"D\u00fcrr, C., Je\u017c, \u0141., & V\u00e1squez, O. C. (2014). Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption. Discrete Applied Mathematics, 196, 20\u201327.","DOI":"10.1016\/j.dam.2014.08.001"},{"key":"466_CR7","doi-asserted-by":"publisher","unstructured":"Epstein, L., Levin, A., Marchetti-Spaccamela, A., Megow, N., Mestre, J., Skutella, M., & Stougie, L. (2010). Universal sequencing on a single machine. In Proceedings of the 14th International Conference of Integer Programming and Combinatorial Optimization (IPCO) (pp. 230\u2013243).","DOI":"10.1007\/978-3-642-13036-6_18"},{"key":"466_CR8","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/1056777.1056779","volume":"37","author":"PE Hart","year":"1972","unstructured":"Hart, P. E., Nilsson, N. J., & Raphael, B. (1972). Correction to a formal basis for the heuristic determination of minimum cost paths. ACM SIGART Bulletin, 37, 28\u201329.","journal-title":"ACM SIGART Bulletin"},{"key":"466_CR9","doi-asserted-by":"publisher","unstructured":"H\u00f6hn, W., & Jacobs, T. (2012a). An experimental and analytical study of order constraints for single machine scheduling with quadratic cost. In Proceedings of the 14th Workshop on Algorithm Engineering and Experiments (ALENEX\u201912) (pp. 103\u2013117).","DOI":"10.1137\/1.9781611972924.11"},{"key":"466_CR10","unstructured":"H\u00f6hn, W., & Jacobs, T. (2012b). Generalized min sum scheduling instance library. \n                        http:\/\/www.coga.tu-berlin.de\/v-menue\/projekte\/complex_scheduling\/generalized_min-sum_scheduling_instance_library\/\n                        \n                    ."},{"key":"466_CR11","doi-asserted-by":"publisher","unstructured":"H\u00f6hn, W., & Jacobs, T. (2012c). On the performance of Smith\u2019s rule in single-machine scheduling with nonlinear cost. In Proceedings of the 10th Latin American Theoretical Informatics Symposium (LATIN) (pp. 482\u2013493).","DOI":"10.1007\/978-3-642-29344-3_41"},{"issue":"5","key":"466_CR12","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1109\/3477.956040","volume":"31","author":"H Kaindl","year":"2001","unstructured":"Kaindl, H., Kainz, G., & Radda, K. (2001). Asymmetry in search. IEEE Transactions on Systems Man and Cybernetics, 31(5), 791\u2013796.","journal-title":"IEEE Transactions on Systems Man and Cybernetics"},{"key":"466_CR13","doi-asserted-by":"publisher","unstructured":"Megow, N., & Verschae, J. (2013). Dual techniques for scheduling on a machine with varying speed. In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP) (pp. 745\u2013756).","DOI":"10.1007\/978-3-642-39206-1_63"},{"issue":"2","key":"466_CR14","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/S0377-2217(99)00207-6","volume":"125","author":"S Mondal","year":"2000","unstructured":"Mondal, S., & Sen, A. (2000). An improved precedence rule for single machine sequencing problems with quadratic penalty. European Journal of Operational Research, 125(2), 425\u2013428.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"466_CR15","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0167-188X(90)90121-W","volume":"18","author":"T Sen","year":"1990","unstructured":"Sen, T., Dileepan, P., & Ruparel, B. (1990). Minimizing a generalized quadratic penalty function of job completion times: An improved branch-and-bound approach. Engineering Costs and Production Economics, 18(3), 197\u2013202.","journal-title":"Engineering Costs and Production Economics"},{"issue":"1\u20132","key":"466_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3(1\u20132), 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"key":"466_CR17","doi-asserted-by":"publisher","unstructured":"Szwarc, W. (1998). Decomposition in single-machine scheduling. Annals of Operations Research, 83, 271\u2013287.","DOI":"10.1023\/A:1018916215399"},{"issue":"5","key":"466_CR18","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1287\/mnsc.24.5.530","volume":"24","author":"W Townsend","year":"1978","unstructured":"Townsend, W. (1978). The single machine problem with quadratic penalty function of completion times: A branch-and-bound solution. Management Science, 24(5), 530\u2013534.","journal-title":"Management Science"},{"key":"466_CR19","doi-asserted-by":"publisher","unstructured":"V\u00e1squez, O. C. (2014). For the airplane refueling problem local precedence implies global precedence. Optimization Letters, 9(4), 663\u2013675.","DOI":"10.1007\/s11590-014-0758-2"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0466-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-015-0466-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0466-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0466-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:52Z","timestamp":1559468392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-015-0466-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,16]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["466"],"URL":"https:\/\/doi.org\/10.1007\/s10951-015-0466-5","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,16]]}}}