{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T19:20:16Z","timestamp":1775157616660,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642137990","type":"print"},{"value":"9783642138003","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13800-3_2","type":"book-chapter","created":{"date-parts":[[2010,6,18]],"date-time":"2010-06-18T02:35:53Z","timestamp":1276828553000},"page":"10-24","source":"Crossref","is-referenced-by-count":11,"title":["A Combination of Evolutionary Algorithm, Mathematical Programming, and a New Local Search Procedure for the Just-In-Time Job-Shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Andr\u00e9 G.","family":"dos Santos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodolfo P.","family":"Araujo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 E. C.","family":"Arroyo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"K.R. Baker","year":"1998","unstructured":"Baker, K.R., Scudder, G.D.: Sequencing with earliness and tardiness penalties: A review. Operations Research\u00a038(1), 22\u201337 (1998)","journal-title":"Operations Research"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J. Du","year":"1990","unstructured":"Du, J., Leung, Y.T.: Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research\u00a015, 483\u2013495 (1990)","journal-title":"Mathematics of Operations Research"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1023\/A:1026224610295","volume":"6","author":"F. Sourd","year":"2003","unstructured":"Sourd, F., Kedad-Sidhoum, S.: The one machine problem with earliness and tardiness penalties. Journal of Scheduling\u00a06, 533\u2013549 (2003)","journal-title":"Journal of Scheduling"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1016\/S0377-2217(03)00016-X","volume":"155","author":"D.C. Mattfeld","year":"2004","unstructured":"Mattfeld, D.C., Bierwirth, C.: An efficient genetic algorithm for job shop scheduling with tardiness objectives. European Journal of Oper. Research\u00a0155, 616\u2013630 (2004)","journal-title":"European Journal of Oper. Research"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1023\/A:1021849405707","volume":"118","author":"J.C. Beck","year":"2003","unstructured":"Beck, J.C., Refalo, P.: A hybrid approach to scheduling with earliness and tardiness costs. Annals of Operations Research\u00a0118, 49\u201371 (2003)","journal-title":"Annals of Operations Research"},{"key":"2_CR6","unstructured":"Kelbel, J., Hanzlek, Z.: Constraint Programming Search Procedure for Earliness\/Tardiness Job Shop Scheduling Problem. In: Proc. of the 26th Workshop of the UK Planning and Scheduling Special Interest Group, pp. 67\u201370 (2007)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1016\/j.cor.2006.05.009","volume":"35","author":"P. Baptiste","year":"2008","unstructured":"Baptiste, P., Flamini, M., Sourd, F.: Lagrangian bounds for just-intime job-shop scheduling. Computers & Operations Research\u00a035, 906\u2013915 (2008)","journal-title":"Computers & Operations Research"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1007\/978-3-540-31880-4_50","volume-title":"Evolutionary Multi-Criterion Optimization","author":"H. Iima","year":"2005","unstructured":"Iima, H.: Proposition of selection operation in a genetic algorithm for a job shop rescheduling problem. In: Coello Coello, C.A., Hern\u00e1ndez Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol.\u00a03410, pp. 721\u2013735. Springer, Heidelberg (2005)"},{"issue":"9","key":"2_CR9","doi-asserted-by":"publisher","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"J. Gao","year":"2007","unstructured":"Gao, J., Sun, L., Gen, M.: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers & Operations Research\u00a035(9), 2892\u20132907 (2007)","journal-title":"Computers & Operations Research"},{"key":"2_CR10","unstructured":"Araujo, R.P., Santos, A.G., Arroyo, J.E.C.: Algoritmo gen\u00e9tico com busca local aplicado ao problema de just-int-time job-shop scheduling. In: Proc. of XLI Brazilian Symposium of Operations Research (2009) (in portuguese)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ejor.2004.03.012","volume":"167","author":"J.F. Gon\u00e7alves","year":"2005","unstructured":"Gon\u00e7alves, J.F., Mendes, J.J.M., Resende, M.G.C.: A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research\u00a0167, 77\u201395 (2005)","journal-title":"European Journal of Operational Research"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1007\/s00170-007-1354-8","volume":"39","author":"C. Zhang","year":"2008","unstructured":"Zhang, C., Rao, Y., Li, P.: An effective hybrid genetic algorithm for the job shop scheduling problem. The International Journal of Advanced Manufacturing Technology\u00a039, 965\u2013974 (2008)","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"2_CR13","unstructured":"Dash Optimization, Ltd. XPRESS-BCL Reference Manual Release 3.0.2 (2006)"},{"key":"2_CR14","unstructured":"Baptiste, P., Flamini, M., Sourd, F.: Job-shop scheduling with earliness tardiness costs, \n                    \n                      http:\/\/www-desir.lip6.fr\/~sourd\/project\/etjssp\/\n                    \n                    \n                   (accessed February 2010)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13800-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T17:24:39Z","timestamp":1552584279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13800-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137990","9783642138003"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13800-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}