{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T08:19:49Z","timestamp":1768724389564,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2010,10,24]],"date-time":"2010-10-24T00:00:00Z","timestamp":1287878400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s12532-010-0019-z","type":"journal-article","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T12:44:12Z","timestamp":1287837852000},"page":"259-290","source":"Crossref","is-referenced-by-count":91,"title":["Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems"],"prefix":"10.1007","volume":"2","author":[{"given":"Artur","family":"Pessoa","sequence":"first","affiliation":[]},{"given":"Eduardo","family":"Uchoa","sequence":"additional","affiliation":[]},{"given":"Marcus Poggi","family":"de Arag\u00e3o","sequence":"additional","affiliation":[]},{"given":"Rosiane","family":"Rodrigues","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,10,24]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1287\/ijoc.1040.0069","volume":"17","author":"P. Avella","year":"2005","unstructured":"Avella P., Boccia M., D\u2019Auria B.: Near-optimal solutions of large scale single-machine scheduling problems. ORSA J. Comput. 17, 183\u2013191 (2005)","journal-title":"ORSA J. Comput."},{"key":"19_CR2","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1016\/j.dam.2008.06.021","volume":"157","author":"H. Ben Amor","year":"2009","unstructured":"Ben Amor H., Frangioni A., Desrosiers J.: On the choice of explicit stabilizing terms in column generation. Discrete Appl. Math. 157, 1167\u20131184 (2009)","journal-title":"Discrete Appl. Math."},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/ijoc.1070.0225","volume":"1","author":"L. Bigras","year":"2008","unstructured":"Bigras L., Gamache M., Savard G.: Time-indexed formulations and the total weighted tardiness problem. INFORMS J. Comput. 1, 133\u2013142 (2008)","journal-title":"INFORMS J. Comput."},{"key":"19_CR4","unstructured":"Dash, S., Fukasawa, R., Gunluk, O.: On the generalized master knapsack polyhedron. In: Proceedings of the 12th IPCO Conference, Lecture Notes in Computer Science, vol. 4513, pp. 197\u2013209 (2007)"},{"key":"19_CR5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(90)90104-K","volume":"26","author":"M. Dyer","year":"1990","unstructured":"Dyer M., Wolsey L.: Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Appl. Math. 26, 255\u2013270 (1990)","journal-title":"Discrete Appl. Math."},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R. Fukasawa","year":"2006","unstructured":"Fukasawa R., Longo H., Lysgaard J., Poggi de Arag\u00e3o M., Reis M., Uchoa E., Werneck R.F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Program. 106, 491\u2013511 (2006)","journal-title":"Math. Program."},{"key":"19_CR7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1287\/ijoc.1090.0341","volume":"22","author":"S. Irnich","year":"2010","unstructured":"Irnich S., Desaulniers G., Desrosiers J., Hadjar A.: Path-reduced costs for eliminating arcs in routing and scheduling. INFORMS J. Comput. 22, 297\u2013313 (2010)","journal-title":"INFORMS J. Comput."},{"key":"19_CR8","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"E. Lawler","year":"1977","unstructured":"Lawler E.: A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. 1, 331\u2013342 (1977)","journal-title":"Ann. Discrete Math."},{"key":"19_CR9","first-page":"115","volume-title":"Computational Combinatorial Optimization","author":"C. Lemar\u00e9chal","year":"2001","unstructured":"Lemar\u00e9chal C.: Lagrangean relaxation. In: Juenger, M., Naddef, D. (eds) Computational Combinatorial Optimization, pp. 115\u2013160. Springer, Berlin (2001)"},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","volume":"194","author":"O. Merle du","year":"1999","unstructured":"du Merle O., Villeneuve D., Desrosiers J., Hansen P.: Stabilized column generation. Discrete Math. 194, 229\u2013237 (1999)","journal-title":"Discrete Math."},{"key":"19_CR11","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1016\/j.cor.2005.05.011","volume":"34","author":"A. Oukil","year":"2007","unstructured":"Oukil A., Ben Amor H., Desrosiers J., El Gueddari H.: Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems. Comput. Oper. Res. 34, 817\u2013834 (2007)","journal-title":"Comput. Oper. Res."},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s10107-006-0013-4","volume":"110","author":"Y. Pan","year":"2007","unstructured":"Pan Y., Shi L.: On the equivalence of the max-\u00a0min transportation lower bound and the time-indexed lower bound for single machine scheduling problems. Math. Program. 110, 543\u2013559 (2007)","journal-title":"Math. Program."},{"key":"19_CR13","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/978-0-387-77778-8_14","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","author":"A. Pessoa","year":"2008","unstructured":"Pessoa A., Poggi de Arag\u00e3o M., Uchoa E.: Robust branch-cut-and-price algorithms for vehicle routing problems. In: Golden, B., Raghavan, S., Wasil, E. (eds) The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 297\u2013326. Springer, Berlin (2008)"},{"key":"19_CR14","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.20330","volume":"54","author":"A. Pessoa","year":"2009","unstructured":"Pessoa A., Uchoa E., Poggi de Arag\u00e3o M.: A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. Networks 54, 167\u2013177 (2009)","journal-title":"Networks"},{"key":"19_CR15","unstructured":"Pessoa, A., Uchoa, E., Poggi de Arag\u00e3o, M., Rodrigues, R.: Algorithms over arc-time indexed formulations for single and parallel machine scheduling problems. Tech. Rep. RPEP Vol.8 no.8, Universidade Federal Fluminense, Engenharia de Produ\u00e7\u00e3o, Niter\u00f3i, Brazil (2008)"},{"key":"19_CR16","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo M.: Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, USA (2002)"},{"key":"19_CR17","first-page":"56","volume-title":"Annals of Mathematical Programming in Rio","author":"M. Poggi de Arag\u00e3o","year":"2003","unstructured":"Poggi de Arag\u00e3o M., Uchoa E.: Integer program reformulation for robust branch-and-cut-and-price. In: Wolsey, L. (eds) Annals of Mathematical Programming in Rio, pp. 56\u201361. B\u00fazios, Brazil (2003)"},{"key":"19_CR18","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.33.2.363","volume":"32","author":"C. Potts","year":"1985","unstructured":"Potts C., Wassenhove L.: A branch-and-bound algorithm for the total weighted tardiness problem. Oper. Res. 32, 363\u2013377 (1985)","journal-title":"Oper. Res."},{"key":"19_CR19","unstructured":"Queyranne, M., Schulz, A.: Polyhedral approaches to machine scheduling. Tech. Rep. 408, University of Berlin (1997)"},{"key":"19_CR20","unstructured":"Rodrigues, R., Pessoa, A., Uchoa, E., Poggi de Arag\u00e3o, M.: Heuristics for multi-machine weighted tardiness problems. Tech. Rep. RPEP Vol.8 no.11, Universidade Federal Fluminense, Engenharia de Produ\u00e7\u00e3o, Niter\u00f3i, Brazil (2008)"},{"key":"19_CR21","unstructured":"Sadykov, R.: Integer programming-based decomposition approaches for solving machine scheduling problems. Ph.D. thesis, Universite Catholique de Louvain (2006)"},{"issue":"1","key":"19_CR22","first-page":"30","volume":"1","author":"N. Souayah","year":"2009","unstructured":"Souayah N., Kacem I., Haouari M., Chu C.: Scheduling on parallel identical machines to minimise the total weighted tardiness. Int. J. Adv. Oper. Manage. 1(1), 30\u201369 (2009)","journal-title":"Int. J. Adv. Oper. Manage."},{"key":"19_CR23","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1287\/ijoc.1080.0287","volume":"21","author":"F. Sourd","year":"2009","unstructured":"Sourd F.: New exact algorithms for one-machine earliness-tardiness scheduling. INFORMS J. Comput. 21, 167\u2013175 (2009)","journal-title":"INFORMS J. Comput."},{"key":"19_CR24","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01586059","volume":"54","author":"J. Sousa","year":"1990","unstructured":"Sousa J., Wolsey L.: A time indexed formulation of non-preemptive single machine scheduling problems. Math. Program. 54, 353\u2013367 (1990)","journal-title":"Math. Program."},{"key":"19_CR25","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1016\/j.ijpe.2007.10.006","volume":"113","author":"S. Tanaka","year":"2008","unstructured":"Tanaka S., Araki M.: A branch and bound algorithm with lagrangian relaxation to minimize total tardiness on identical parallel machines. Int. J. Prod. Econ. 113, 446\u2013458 (2008)","journal-title":"Int. J. Prod. Econ."},{"key":"19_CR26","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/s10951-008-0093-5","volume":"12","author":"S. Tanaka","year":"2009","unstructured":"Tanaka S., Fujikuma S., Araki M.: An exact algorithm for single-machine scheduling without machine idle time. J. Sched. 12, 575\u2013593 (2009)","journal-title":"J. Sched."},{"key":"19_CR27","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10107-006-0043-y","volume":"122","author":"E. Uchoa","year":"2008","unstructured":"Uchoa E., Fukasawa R., Lysgaard J., Pessoa A., Poggi de Arag\u00e3o M., Andrade D.: Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation. Math. Program. 122, 443\u2013472 (2008)","journal-title":"Math. Program."},{"issue":"2","key":"19_CR28","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/ijoc.12.2.111.11896","volume":"12","author":"J. Van der Akker","year":"2000","unstructured":"Van der Akker J., Hurkens C., Savelsbergh M.: Time-indexed formulations for machine scheduling problems: column generation. INFORMS J. Comput. 12(2), 111\u2013124 (2000)","journal-title":"INFORMS J. Comput."},{"key":"19_CR29","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s10107990047a","volume":"85","author":"J. Van der Akker","year":"1999","unstructured":"Van der Akker J., Van Hoesel C., Savelsbergh M.: A polyhedral approach to single-machine scheduling problems. Math. Program. 85, 541\u2013572 (1999)","journal-title":"Math. Program."},{"key":"19_CR30","first-page":"151","volume":"4","author":"P. Wentges","year":"1997","unstructured":"Wentges P.: Weighted dantzig-wolfe decomposition for linear mixed-integer programming. Int. Trans. Oper. Res. 4, 151\u2013162 (1997)","journal-title":"Int. Trans. Oper. Res."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-010-0019-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-010-0019-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-010-0019-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T12:15:56Z","timestamp":1559477756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-010-0019-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,24]]},"references-count":30,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["19"],"URL":"https:\/\/doi.org\/10.1007\/s12532-010-0019-z","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,24]]}}}