{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T18:14:44Z","timestamp":1694628884205},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,3,6]],"date-time":"2007-03-06T00:00:00Z","timestamp":1173139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2007,3,6]],"date-time":"2007-03-06T00:00:00Z","timestamp":1173139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s10589-007-9018-z","type":"journal-article","created":{"date-parts":[[2007,3,5]],"date-time":"2007-03-05T14:51:04Z","timestamp":1173106264000},"page":"219-229","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A local search using solution fragments for the 2-machine bicriteria scheduling problem"],"prefix":"10.1007","volume":"37","author":[{"given":"Gaofeng","family":"Huang","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Lim","sequence":"additional","affiliation":[]},{"given":"Brian","family":"Rodrigues","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,3,6]]},"reference":[{"key":"9018_CR1","first-page":"662","volume-title":"Proceedings of the Third Industrial Engineering Research Conference","author":"C.L. Chen","year":"1994","unstructured":"Chen, C.L., Bulfin, R.L.: Complexity results for multi-machine multi-criteria scheduling problems. In: Proceedings of the Third Industrial Engineering Research Conference, pp.\u00a0662\u2013665. Institute of Industrials Engineers, Georgia (1994)"},{"key":"9018_CR2","volume-title":"Theory of Scheduling","author":"R.W. Conway","year":"1967","unstructured":"Conway, R.W., Maxwell, W.L., Miller, L.W.: Theory of Scheduling. Addison-Wesley, Reading (1967)"},{"key":"9018_CR3","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0305-0548(00)00061-7","volume":"29","author":"J.N.D. Gupta","year":"2002","unstructured":"Gupta, J.N.D., Hennig, K., Werner, F.: Local search heuristics for two-stage flow shop problems with secondary criterion. Comput. Oper. Res. 29, 123\u2013149 (2002)","journal-title":"Comput. Oper. Res."},{"key":"9018_CR4","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0925-5273(00)00039-6","volume":"69","author":"J.N.D. Gupta","year":"2001","unstructured":"Gupta, J.N.D., Neppalli, V.R., Werner, F.: Minimizing total flow time in a two-machine flowshop problem with minimum makespan. International J. Prod. Econ. 69, 323\u2013338 (2001)","journal-title":"International J. Prod. Econ."},{"key":"9018_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1080\/095372899233217","volume":"10","author":"J.N.D. Gupta","year":"1999","unstructured":"Gupta, J.N.D., Palanimuthu, N., Chen, C.L.: Designing a tabu search algorithm for the two-stage flowshop problem with secondary criterion. Prod. Plan. Control 10, 251\u2013265 (1999)","journal-title":"Prod. Plan. Control"},{"key":"9018_CR6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"S.M. Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Nav. Res. Logist. Q. 1, 61\u201368 (1954)","journal-title":"Nav. Res. Logist. Q."},{"key":"9018_CR7","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/0377-2217(95)00275-8","volume":"95","author":"V.R. Neppalli","year":"1996","unstructured":"Neppalli, V.R., Chen, C.L., Gupta, J.N.D.: Genetic algorithm for the two-stage bicriteria flowshop problem. Eur. J. Oper. Res. 95, 356\u2013373 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"9018_CR8","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1057\/palgrave.jors.0430903","volume":"43","author":"C. Rajendran","year":"1992","unstructured":"Rajendran, C.: Two-stage flow shop scheduling problem with bicriteria. J. Oper. Res. Soc. 43(9), 871\u2013884 (1992)","journal-title":"J. Oper. Res. Soc."},{"key":"9018_CR9","unstructured":"T\u2019Kindt, V., Gupta, J.N.D., Billaut, J.-C.: A branch-and-bound algorithm to solve a two-machine bicriteria flowshop scheduling problem. Presented at ORP3 2001 \u2014 Operational Research Peripatetic Post-graduate Programme Conference, Paris, 2001"},{"key":"9018_CR10","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/S0377-2217(02)00265-5","volume":"142","author":"V. T\u2019Kindt","year":"2002","unstructured":"T\u2019Kindt, V., Monmarch\u00e9, N., Tercinet, F., La\u00fcgt, D.: An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem. Eur. J. Oper. Res. 142, 250\u2013257 (2002)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9018-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-007-9018-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9018-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9018-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,18]],"date-time":"2022-05-18T01:32:48Z","timestamp":1652837568000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-007-9018-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,6]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["9018"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9018-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,6]]},"assertion":[{"value":"27 October 2004","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2005","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2007","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}