{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T15:28:37Z","timestamp":1750433317576,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T00:00:00Z","timestamp":1517443200000},"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":["Optim Lett"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s11590-018-1237-y","type":"journal-article","created":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T07:51:45Z","timestamp":1517471505000},"page":"903-914","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An exact algorithm for the bi-objective timing problem"],"prefix":"10.1007","volume":"12","author":[{"given":"Sophie","family":"Jacquin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fanny","family":"Dufoss\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4170-6830","authenticated-orcid":false,"given":"Laetitia","family":"Jourdan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,1]]},"reference":[{"issue":"1","key":"1237_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/mnsc.25.1.73","volume":"25","author":"YP Aneja","year":"1979","unstructured":"Aneja, Y.P., Nair, K.P.: Bicriteria transportation problem. Manag. Sci. 25(1), 73\u201378 (1979)","journal-title":"Manag. Sci."},{"issue":"2","key":"1237_CR2","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0360-8352(03)00034-2","volume":"45","author":"M Azizoglu","year":"2003","unstructured":"Azizoglu, M., Kondakci, S., Kksalan, M.: Single machine scheduling with maximum earliness and number tardy. Comput. Ind. Eng. 45(2), 257\u2013268 (2003)","journal-title":"Comput. Ind. Eng."},{"issue":"11","key":"1237_CR3","doi-asserted-by":"publisher","first-page":"3219","DOI":"10.1016\/j.cor.2005.02.037","volume":"33","author":"J Bauman","year":"2006","unstructured":"Bauman, J., J\u00f3zefowska, J.: Minimizing the earliness\u2013tardiness costs on a single machine. Comput. Oper. Res. 33(11), 3219\u20133230 (2006)","journal-title":"Comput. Oper. Res."},{"key":"1237_CR4","doi-asserted-by":"crossref","unstructured":"Dantas, J.D., Varela, L.R.: Scheduling single-machine problem based on just-in-time principles. In: 2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC), pp. 164\u2013169. IEEE (2014)","DOI":"10.1109\/NaBIC.2014.6921872"},{"key":"1237_CR5","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2006","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Berlin (2006)"},{"issue":"2","key":"1237_CR6","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1287\/opre.1110.1014","volume":"60","author":"YP Fang","year":"2012","unstructured":"Fang, Y.P., Meng, K., Yang, X.Q.: Piecewise linear multicriteria programs: the continuous case and its discontinuous generalization. Oper. Res. 60(2), 398\u2013409 (2012)","journal-title":"Oper. Res."},{"issue":"2","key":"1237_CR7","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/S0360-8352(02)00181-X","volume":"44","author":"M Feldmann","year":"2003","unstructured":"Feldmann, M., Biskup, D.: Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches. Comput. Ind. Eng. 44(2), 307\u2013323 (2003)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"1237_CR8","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.disopt.2008.08.001","volume":"6","author":"Y Hendel","year":"2009","unstructured":"Hendel, Y., Runge, N., Sourd, F.: The one-machine just-in-time scheduling problem with preemption. Discrete Optim. 6(1), 10\u201322 (2009)","journal-title":"Discrete Optim."},{"issue":"10","key":"1237_CR9","doi-asserted-by":"publisher","first-page":"2931","DOI":"10.1016\/j.cor.2005.11.004","volume":"34","author":"Y Hendel","year":"2007","unstructured":"Hendel, Y., Sourd, F.: An improved earliness\u2013tardiness timing algorithm. Comput. Oper. Res. 34(10), 2931\u20132938 (2007)","journal-title":"Comput. Oper. Res."},{"key":"1237_CR10","doi-asserted-by":"crossref","unstructured":"Jacquin, S., Allart, E., Dufoss\u00e9, F., Jourdan, L.: Decoder-based evolutionary algorithm for bi-objective just-in-time single-machine job-shop. In: IEEE Symposium Series on Computational Intelligence, SSCI, pp. 1\u20138 (2016)","DOI":"10.1109\/SSCI.2016.7850054"},{"key":"1237_CR11","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ins.2012.11.007","volume":"226","author":"L Liu","year":"2013","unstructured":"Liu, L., Zhou, H.: Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness\/tardiness problem. Inf. Sci. 226, 68\u201392 (2013)","journal-title":"Inf. Sci."},{"issue":"9","key":"1237_CR12","doi-asserted-by":"publisher","first-page":"2549","DOI":"10.1016\/j.mcm.2013.01.007","volume":"57","author":"M Mahnam","year":"2013","unstructured":"Mahnam, M., Moslehi, G., Ghomi, S.M.T.F.: Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness. Math. Comput, Model. 57(9), 2549\u20132563 (2013)","journal-title":"Math. Comput, Model."},{"key":"1237_CR13","first-page":"81","volume":"61","author":"T Qin","year":"2015","unstructured":"Qin, T., Peng, B., Benlic, U., Cheng, T., Wang, Y., L\u00fc, Z.: Iterated local search based on multi-type perturbation for single-machine earliness\/tardiness scheduling. COR 61, 81\u201388 (2015)","journal-title":"COR"},{"issue":"11\u201312","key":"1237_CR14","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1007\/s00170-008-1558-6","volume":"41","author":"A Rahimi-Vahed","year":"2009","unstructured":"Rahimi-Vahed, A., Dangchi, M., Rafiei, H., Salimi, E.: A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem. Int. J. Adv. Manuf. Technol. 41(11\u201312), 1227\u20131239 (2009)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"5","key":"1237_CR15","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s00500-007-0210-y","volume":"12","author":"A Rahimi-Vahed","year":"2008","unstructured":"Rahimi-Vahed, A., Mirzaei, A.H.: Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm. Soft Comput. 12(5), 435\u2013452 (2008)","journal-title":"Soft Comput."},{"key":"1237_CR16","unstructured":"Sourd, F., Kedad-Sidhoum, S.: An efficient algorithm for the earliness\u2013tardiness scheduling problem. Optim. Online 1205 (2005)"},{"issue":"3","key":"1237_CR17","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10951-011-0242-0","volume":"15","author":"S Tanaka","year":"2012","unstructured":"Tanaka, S., Fujikuma, S.: A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time. J. Sched. 15(3), 347\u2013361 (2012)","journal-title":"J. Sched."},{"key":"1237_CR18","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A unifying view on timing problems and algorithms. CIRRELT-2011-43, Montr\u00e9al, QC, Canada (2011)"},{"issue":"11","key":"1237_CR19","doi-asserted-by":"publisher","first-page":"3191","DOI":"10.1080\/00207541003733783","volume":"49","author":"T Vincent","year":"2011","unstructured":"Vincent, T.: Multicriteria models for just-in-time scheduling. Int. J. Prod. Res. 49(11), 3191\u20133209 (2011)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"1237_CR20","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ejor.2008.01.029","volume":"195","author":"G Wan","year":"2009","unstructured":"Wan, G., Yen, B.P.C.: Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs. Eur. J. Oper. Res. 195(1), 89\u201397 (2009)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-018-1237-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1237-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1237-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T23:57:35Z","timestamp":1570665455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-018-1237-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,1]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["1237"],"URL":"https:\/\/doi.org\/10.1007\/s11590-018-1237-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2018,2,1]]},"assertion":[{"value":"5 December 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}