{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T17:41:48Z","timestamp":1755798108049},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,11,3]],"date-time":"2015-11-03T00:00:00Z","timestamp":1446508800000},"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":["J Sched"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s10951-015-0459-4","type":"journal-article","created":{"date-parts":[[2015,11,3]],"date-time":"2015-11-03T01:39:19Z","timestamp":1446514759000},"page":"33-42","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["MP or not MP: that is the question"],"prefix":"10.1007","volume":"19","author":[{"given":"Federico","family":"Della Croce","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,3]]},"reference":[{"key":"459_CR1","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1057\/palgrave.jors.2601478","volume":"54","author":"M Azizoglu","year":"2003","unstructured":"Azizoglu, M., Koksalan, M., & Koksalan, S. K. (2003). Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed. Journal of the Operational Research Society, 54, 661\u2013664.","journal-title":"Journal of the Operational Research Society"},{"key":"459_CR2","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1016\/j.cie.2010.07.028","volume":"59","author":"KR Baker","year":"2010","unstructured":"Baker, K. R., & Keller, B. (2010). Solving the single-machine sequencing problem using integer programming. Computers and Industrial Engineering, 59, 730\u2013735.","journal-title":"Computers and Industrial Engineering"},{"key":"459_CR3","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10951-008-0092-6","volume":"13","author":"Ph Baptiste","year":"2010","unstructured":"Baptiste, Ph, Della Croce, F., Grosso, A., & Tkindt, V. (2010). Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances. Journal of Scheduling, 13, 39\u201347.","journal-title":"Journal of Scheduling"},{"key":"459_CR4","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0377-2217(91)90304-E","volume":"51","author":"J Blazewicz","year":"1991","unstructured":"Blazewicz, J., Dror, M., & Weglarz, J. (1991). Mathematical programming formulations for machine scheduling: A survey. European Journal of Operational Research, 51, 283\u2013300.","journal-title":"European Journal of Operational Research"},{"key":"459_CR5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.tcs.2014.04.004","volume":"540\u2013541","author":"N Boria","year":"2014","unstructured":"Boria, N., & Della Croce, F. (2014). Re-optimization in machine scheduling. Theoretical Computer Science, 540\u2013541, 13\u201326.","journal-title":"Theoretical Computer Science"},{"key":"459_CR6","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1007\/s00453-010-9460-7","volume":"62","author":"N Bourgeois","year":"2012","unstructured":"Bourgeois, N., Escoffier, B., Paschos, V Th, & van Rooij, J. M. M. (2012). Fast algorithms for max independent set. Algorithmica, 62, 382\u2013415.","journal-title":"Algorithmica"},{"key":"459_CR7","unstructured":"Christofides, N. (1976). Worst-case analysis of a new heuristic for the traveling salesman problem, Technical report, GSIA, Carnegie-Mellon University, Pittsburgh."},{"key":"459_CR8","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.cor.2013.11.016","volume":"45","author":"F Della Croce","year":"2014","unstructured":"Della Croce, F., Salassa, F., & T\u2019kindt, V. (2014). A hybrid heuristic approach for single machine scheduling with release times. Computers and Operations Research, 45, 7\u201311.","journal-title":"Computers and Operations Research"},{"key":"459_CR9","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/S0167-6377(02)00215-8","volume":"31","author":"F Della Croce","year":"2003","unstructured":"Della Croce, F., & T\u2019kindt, V. (2003). Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. Operations Research Letters, 31, 142\u2013148.","journal-title":"Operations Research Letters"},{"key":"459_CR10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0196-6774(03)00078-6","volume":"49","author":"DW Engels","year":"2003","unstructured":"Engels, D. W., Karger, D. R., Kolliopoulos, S. G., Sengupta, S., Uma, R. N., & Wein, J. (2003). Techniques for scheduling with rejection. Journal of Algorithms, 49, 175\u2013191.","journal-title":"Journal of Algorithms"},{"key":"459_CR11","unstructured":"Eppstein, D. (2001). Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction, In Proceedings of Symposium on Discrete Algorithms, SODA01 (pp. 329\u2013337)."},{"key":"459_CR12","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.orl.2005.01.010","volume":"34","author":"O Ergun","year":"2006","unstructured":"Ergun, O., & Orlin, J. B. (2006). Fast neighborhood search for the single machine total weighted tardiness problem. Operations Research Letters, 34, 41\u201345.","journal-title":"Operations Research Letters"},{"key":"459_CR13","doi-asserted-by":"crossref","unstructured":"Fomin, F. V., Grandoni, F., & Kratsch, D. (2009). A measure and conquer approach for the analysis of exact algorithms. Journal of the ACM, 56, 1\u201332.","DOI":"10.1145\/1552285.1552286"},{"key":"459_CR14","unstructured":"Lasserre, J. B., & Queyranne, M. (1992). Generic scheduling polyhedral and a new mixed integer formulation for single machine scheduling. In Proceedings of the IPCO Conference (pp. 136\u2013149)."},{"key":"459_CR15","volume-title":"The traveling salesman problem: A guided tour of combinatorial optimization","author":"EL Lawler","year":"1985","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1985). The traveling salesman problem: A guided tour of combinatorial optimization. New York: Wiley. (Ed.)."},{"key":"459_CR16","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume-title":"Logistics of Production and Inventory","author":"EL Lawler","year":"1993","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1993). Sequencing and scheduling: Algorithms and complexity. In S. C. Graves, A. H. G. Rinnooy Kan, & P. H. Zipkin (Eds.), Logistics of Production and Inventory (pp. 445\u2013522). Amsterdam: North Holland."},{"key":"459_CR17","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1142\/9789814354363_0013","volume-title":"Complexity in numerical optimization","author":"CY Lee","year":"1993","unstructured":"Lee, C. Y., & Vairaktarakis, G. L. (1993). Complexity of single machine hierarchical scheduling: A survey. In P. M. Pardalos (Ed.), Complexity in numerical optimization (pp. 269\u2013298). Singapore: World Scientific."},{"key":"459_CR18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0377-2217(02)00180-7","volume":"145","author":"R MHallah","year":"2003","unstructured":"MHallah, R., & Bulfin, R. L. (2003). Minimizing the weighted number of tardy jobs on a single machine. European Journal of Operational Research, 145, 45\u201356.","journal-title":"European Journal of Operational Research"},{"key":"459_CR19","doi-asserted-by":"crossref","first-page":"42","DOI":"10.4018\/jaec.2012040103","volume":"3","author":"A Moghaddam","year":"2012","unstructured":"Moghaddam, A., Amodeo, L., Yalaoui, F., & Karimi, B. (2012). Single machine scheduling with rejection: Minimizing total weighted completion time and rejection cost. International Journal of Applied Evolutionary Computation, 3, 42\u201361.","journal-title":"International Journal of Applied Evolutionary Computation"},{"key":"459_CR20","doi-asserted-by":"crossref","first-page":"2909","DOI":"10.1016\/j.camwa.2010.09.046","volume":"60","author":"E Molaee","year":"2010","unstructured":"Molaee, E., Moslehi, G., & Reisi, M. (2010). Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem. Computers and Mathematics with Applications, 60, 2909\u20132919.","journal-title":"Computers and Mathematics with Applications"},{"key":"459_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.18.1.1","volume":"18","author":"CH Papadimitriou","year":"1993","unstructured":"Papadimitriou, C. H., & Yannakakis, M. (1993). The traveling salesman problem with distances one and two. Mathematics of Operations Research, 18, 1\u201311.","journal-title":"Mathematics of Operations Research"},{"key":"459_CR22","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/S0377-2217(02)00073-5","volume":"140","author":"F Plastria","year":"2002","unstructured":"Plastria, F. (2002). Formulating logical implications in combinatorial optimisation. European Journal of Operational Research, 140, 338\u2013353.","journal-title":"European Journal of Operational Research"},{"key":"459_CR23","volume-title":"Dynasearch: Iterative local improvement by dynamic programming: Part i, the traveling salesman problem, faculty of mathematical studies","author":"CNP Potts","year":"1995","unstructured":"Potts, C. N. P., & Van de Velde, S. L. (1995). Dynasearch: Iterative local improvement by dynamic programming: Part i, the traveling salesman problem, faculty of mathematical studies. Southampton: University of Southampton."},{"key":"459_CR24","first-page":"155","volume-title":"Intelligent scheduling systems","author":"SS Smith","year":"1994","unstructured":"Smith, S. S. (1994). Reactive scheduling systems. In D. E. Brown & W. T. Scherer (Eds.), Intelligent scheduling systems (pp. 155\u2013192). Boston: Kluwer Academic Publishers."},{"key":"459_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04986-0","volume-title":"Multicriteria scheduling: Theory, models and algorithms","author":"V T\u2019Kindt","year":"2002","unstructured":"T\u2019Kindt, V., & Billaut, J.-C. (2002). Multicriteria scheduling: Theory, models and algorithms. Heidelberg: Springer."},{"key":"459_CR26","volume-title":"Model building in mathematical programming","author":"HP Williams","year":"1990","unstructured":"Williams, H. P. (1990). Model building in mathematical programming. New York: Wiley."},{"key":"459_CR27","first-page":"185","volume-title":"Combinatorial Optimization: Eureka! You shrink!, volume 2570 of Lecture Notes in Computer Science","author":"GJ Woeginger","year":"2003","unstructured":"Woeginger, G. J. (2003). Exact algorithms for NP-hard problems: A survey. In M. Juenger, G. Reinelt, & G. Rinaldi (Eds.), Combinatorial Optimization: Eureka! You shrink!, volume 2570 of Lecture Notes in Computer Science (pp. 185\u2013207). New York: Springer."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0459-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-015-0459-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0459-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:52Z","timestamp":1559453992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-015-0459-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,3]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["459"],"URL":"https:\/\/doi.org\/10.1007\/s10951-015-0459-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,3]]}}}