{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:56Z","timestamp":1759063616151},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2010,2,24]],"date-time":"2010-02-24T00:00:00Z","timestamp":1266969600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Prod. Eng. Res. Devel."],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1007\/s11740-010-0211-z","type":"journal-article","created":{"date-parts":[[2010,2,23]],"date-time":"2010-02-23T21:49:35Z","timestamp":1266961775000},"page":"221-230","source":"Crossref","is-referenced-by-count":5,"title":["Earliness-tardiness-lost sales dynamic job-shop scheduling"],"prefix":"10.1007","volume":"4","author":[{"given":"S. M. T.","family":"Fatemi Ghomi","sequence":"first","affiliation":[]},{"given":"Mehdi","family":"Iranpoor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,24]]},"reference":[{"issue":"1","key":"211_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0895-7177(97)00250-1","volume":"27","author":"Ling-Huey Su","year":"1998","unstructured":"Su L-H, Chang P-C (1998) A heuristic for scheduling general job shops to minimize maximum lateness. Math Comput Model 27(1):1\u201315","journal-title":"Math Comput Model"},{"key":"211_CR2","volume-title":"Introduction to sequencing and scheduling","author":"RK Baker","year":"1974","unstructured":"Baker RK (1974) Introduction to sequencing and scheduling. John Wiley, New York"},{"issue":"4","key":"211_CR3","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.8.4.487","volume":"8","author":"B Giffler","year":"1960","unstructured":"Giffler B, Thompson GL (1960) Algorithms for solving production scheduling problems. Oper Res 8(4):487\u2013503","journal-title":"Oper Res"},{"key":"211_CR4","volume-title":"Industrial scheduling","author":"RS Dileep","year":"1997","unstructured":"Dileep RS (1997) Industrial scheduling. PWS Publishing Company, Boston"},{"issue":"3","key":"211_CR5","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1988","unstructured":"Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job-shop scheduling. Manage Sci 34(3):391\u2013401","journal-title":"Manage Sci"},{"issue":"1","key":"211_CR6","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"PJM Laarhooven Van","year":"1992","unstructured":"Van Laarhooven PJM, Aarts EHL, Lenstra JK (1992) Job shop scheduling by simulated annealing. Oper Res 40(1):113\u2013125","journal-title":"Oper Res"},{"key":"211_CR7","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0377-2217(94)00361-0","volume":"91","author":"Z He","year":"1996","unstructured":"He Z, Yang T, Tiger A (1996) An exchange heuristic embedded with simulated annealing for due-dates job-shop scheduling. Eur J Oper Res 91:99\u2013117","journal-title":"Eur J Oper Res"},{"key":"211_CR8","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1023\/B:JIMS.0000042665.10086.cf","volume":"15","author":"Aydin Emin","year":"2004","unstructured":"Emin Aydin, Terence M, Fogarty C (2004) A simulated annealing algorithm for multi-agent systems: a job-shop scheduling application. J Intell Manuf 15:805\u2013814","journal-title":"J Intell Manuf"},{"issue":"3","key":"211_CR9","doi-asserted-by":"crossref","first-page":"1894","DOI":"10.1016\/j.ejor.2005.12.013","volume":"177","author":"A El-Bouri","year":"2007","unstructured":"El-Bouri A, Azizi N, Zolfaghari S (2007) A comparative study of a new heuristic based on adaptive memory and simulated annealing: The case of job shop scheduling. Eur J Oper Res 177(3):1894\u20131910","journal-title":"Eur J Oper Res"},{"key":"211_CR10","unstructured":"Nakano R, Yamada T (1991). In: Kenneth MK, BookerLB (ed) Proceedings of International Conference on Genetic Algorithms. San Diego: ICGA, pp 474\u2013479"},{"key":"211_CR11","doi-asserted-by":"crossref","unstructured":"Yamada T, Nakano R (1997) Job-shop scheduling. In: Zalzala AMS and Fleming PJ (ed) Genetic algorithms in engineering systems (control engineering series 55). IEE, London, pp 134\u2013160","DOI":"10.1049\/PBCE055E_ch7"},{"key":"211_CR12","first-page":"145","volume":"3","author":"BA Norman","year":"1997","unstructured":"Norman BA, Bean J (1997) Random keys genetic algorithm for job-shop scheduling. Eng Des Autom 3:145\u2013156","journal-title":"Eng Des Autom"},{"key":"211_CR13","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/S0305-0548(99)00137-9","volume":"28","author":"L Wang","year":"2001","unstructured":"Wang L, Zheng DZ (2001) An effective hybrid optimization strategy for job-shop scheduling problems. Comput Oper Res 28:585\u2013596","journal-title":"Comput Oper Res"},{"issue":"9","key":"211_CR14","doi-asserted-by":"crossref","first-page":"1264","DOI":"10.1287\/mnsc.20.9.1264","volume":"20","author":"CA Holloway","year":"1974","unstructured":"Holloway CA, Nelson RT (1974) Job shop scheduling with due dates and variable processing times. Manage Sci 20(9):1264\u20131275","journal-title":"Manage Sci"},{"key":"211_CR15","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.advengsoft.2004.10.002","volume":"36","author":"SQ Liu","year":"2005","unstructured":"Liu SQ, Ong HL, Ng KM (2005) Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem. Adv Eng Softw 36:199\u2013205","journal-title":"Adv Eng Softw"},{"key":"211_CR16","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/j.cie.2005.06.005","volume":"49","author":"S Thiagarajan","year":"2005","unstructured":"Thiagarajan S, Rajendran C (2005) Scheduling in dynamic assembly job-shop to minimize the sum of weighted earliness, weighted tardiness and weighted flow time of jobs. Comput Ind Eng 49:463\u2013503","journal-title":"Comput Ind Eng"}],"container-title":["Production Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11740-010-0211-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11740-010-0211-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11740-010-0211-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T21:32:06Z","timestamp":1559424726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11740-010-0211-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,24]]},"references-count":16,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["211"],"URL":"https:\/\/doi.org\/10.1007\/s11740-010-0211-z","relation":{},"ISSN":["0944-6524","1863-7353"],"issn-type":[{"value":"0944-6524","type":"print"},{"value":"1863-7353","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,24]]}}}