{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T10:59:56Z","timestamp":1781175596366,"version":"3.54.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,6,20]],"date-time":"2008-06-20T00:00:00Z","timestamp":1213920000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1007\/s10489-008-0134-y","type":"journal-article","created":{"date-parts":[[2008,6,19]],"date-time":"2008-06-19T14:01:50Z","timestamp":1213884110000},"page":"47-59","source":"Crossref","is-referenced-by-count":34,"title":["A hybrid approach to large-scale job shop scheduling"],"prefix":"10.1007","volume":"32","author":[{"given":"Rui","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cheng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,6,20]]},"reference":[{"issue":"3","key":"134_CR1","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":"12","key":"134_CR2","doi-asserted-by":"crossref","first-page":"3373","DOI":"10.1002\/aic.690421209","volume":"42","author":"MH Bassett","year":"1996","unstructured":"Bassett MH, Pekny JF, Reklaitis GV (1996) Decomposition techniques for the solution of large-scale scheduling problems. AIChE J 42(12):3373\u20133387","journal-title":"AIChE J"},{"key":"134_CR3","series-title":"Lecture notes in computer science","volume-title":"Optimization methods for large-scale production scheduling problems","author":"R Braune","year":"2007","unstructured":"Braune R, Wagner S, Affenzeller M (2007) Optimization methods for large-scale production scheduling problems. Lecture notes in computer science, vol 4739. Springer, Berlin, pp 812\u2013819"},{"issue":"2","key":"134_CR4","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1109\/70.681248","volume":"14","author":"ES Byeon","year":"1998","unstructured":"Byeon ES, Wu SD, Storer RH (1998) Decomposition heuristics for robust job-shop scheduling. IEEE Trans Robot Autom 14(2):303\u2013313","journal-title":"IEEE Trans Robot Autom"},{"issue":"4","key":"134_CR5","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/0360-8352(96)00047-2","volume":"34","author":"R Cheng","year":"1996","unstructured":"Cheng R, Gen M (1996) A tutorial survey of job-shop scheduling problems using genetic algorithms\u2014Part I: representation. Comput Ind Eng 34(4):983\u2013997","journal-title":"Comput Ind Eng"},{"issue":"2","key":"134_CR6","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0360-8352(99)00136-9","volume":"36","author":"R Cheng","year":"1999","unstructured":"Cheng R, Gen M (1999) A tutorial survey of job-shop scheduling problems using genetic algorithms\u2014Part II: hybrid genetic search strategies. Comput Ind Eng 36(2):343\u2013364","journal-title":"Comput Ind Eng"},{"issue":"1","key":"134_CR7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0305-0548(93)E0015-L","volume":"22","author":"FD Croce","year":"1995","unstructured":"Croce FD, Tadei R, Volta G (1995) A genetic algorithm for the job-shop problem. Comput Oper Res 22(1):15\u201324","journal-title":"Comput Oper Res"},{"issue":"3","key":"134_CR8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","volume":"41","author":"M Dell\u2019Amico","year":"1993","unstructured":"Dell\u2019Amico M, Trubian M (1993) Applying tabu search to the job-shop scheduling problem. Ann Oper Res 41(3):231\u2013252","journal-title":"Ann Oper Res"},{"issue":"8","key":"134_CR9","doi-asserted-by":"crossref","first-page":"2599","DOI":"10.1016\/j.cor.2006.12.019","volume":"35","author":"I Essafi","year":"2008","unstructured":"Essafi I, Mati Y, Dauz\u00e8re-P\u00e9r\u00e8s S (2008) A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Comput Oper Res 35(8):2599\u20132616","journal-title":"Comput Oper Res"},{"issue":"2","key":"134_CR10","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","volume":"113","author":"AS Jain","year":"1999","unstructured":"Jain AS, Meeran S (1999) Deterministic job-shop scheduling: Past, present and future. Eur J Oper Res 113(2):390\u2013434","journal-title":"Eur J Oper Res"},{"key":"134_CR11","volume-title":"Neuro-fuzzy and soft computing","author":"JSR Jang","year":"1997","unstructured":"Jang JSR, Sun CT, Mizutani E (1997) Neuro-fuzzy and soft computing. Prentice-Hall, Englewood Cliffs"},{"issue":"5","key":"134_CR12","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1109\/3468.867862","volume":"30","author":"L Jiao","year":"2000","unstructured":"Jiao L, Wang L (2000) A novel genetic algorithm based on immunity. IEEE Tran Syst Man Cybern Part A 30(5):552\u2013561","journal-title":"IEEE Tran Syst Man Cybern Part A"},{"issue":"1","key":"134_CR13","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0377-2217(97)00420-7","volume":"113","author":"M Kolonko","year":"1999","unstructured":"Kolonko M (1999) Some new results on simulated annealing applied to the job shop scheduling problem. Eur J Oper Res 113(1):123\u2013136","journal-title":"Eur J Oper Res"},{"issue":"1","key":"134_CR14","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"PJM Laarhoven","year":"1992","unstructured":"Laarhoven PJM, Aarts EHL, Lenstra JK (1992) Job shop scheduling by simulated annealing. Oper Res 40(1):113\u2013125","journal-title":"Oper Res"},{"key":"134_CR15","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"7","author":"JK Lenstra","year":"1977","unstructured":"Lenstra JK, Kan AHGR, Brucker P (1977) Complexity of machine scheduling problems. Ann Discrete Math 7:343\u2013362","journal-title":"Ann Discrete Math"},{"issue":"3\u20134","key":"134_CR16","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/j.mcm.2007.03.032","volume":"47","author":"M Liu","year":"2008","unstructured":"Liu M, Hao JH, Wu C (2008) A prediction based iterative decomposition algorithm for scheduling large-scale job shops. Math Comput Model 47(3\u20134):411\u2013421","journal-title":"Math Comput Model"},{"key":"134_CR17","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1023\/A:1018948621875","volume":"76","author":"PB Luh","year":"1998","unstructured":"Luh PB, Gou L, Zhang Y, Nagahora T, Tsuji M, Yoneda K, Hasegawa T, Kyoya Y, Kano T (1998) Job shop scheduling with group-dependent setups, finite buffers and long time horizon. Ann Oper Res 76:233\u2013259","journal-title":"Ann Oper Res"},{"issue":"3","key":"134_CR18","doi-asserted-by":"crossref","first-page":"2100","DOI":"10.1016\/j.ejor.2005.12.020","volume":"177","author":"L M\u00f6nch","year":"2007","unstructured":"M\u00f6nch L, Schabacker R, Pabst D, Fowler JW (2007) Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops. Eur J Oper Res 177(3):2100\u20132118","journal-title":"Eur J Oper Res"},{"issue":"6","key":"134_CR19","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Manage Sci 42(6):797\u2013813","journal-title":"Manage Sci"},{"issue":"1","key":"134_CR20","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.25.1.45","volume":"25","author":"SS Panwalkar","year":"1977","unstructured":"Panwalkar SS, Iskander W (1977) A survey of scheduling rules. Oper Res 25(1):45\u201361","journal-title":"Oper Res"},{"issue":"3","key":"134_CR21","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0305-0548(97)00054-3","volume":"25","author":"MW Park","year":"1998","unstructured":"Park MW, Kim YD (1998) A systematic procedure for setting parameters in simulated annealing algorithms. Comput Oper Res 25(3):207\u2013217","journal-title":"Comput Oper Res"},{"issue":"3","key":"134_CR22","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0305-0548(99)00098-2","volume":"28","author":"M Singer","year":"2001","unstructured":"Singer M (2001) Decomposition methods for large job shops. Comput Oper Res 28(3):193\u2013207","journal-title":"Comput Oper Res"},{"issue":"7","key":"134_CR23","doi-asserted-by":"crossref","first-page":"2019","DOI":"10.1080\/00207549608905010","volume":"34","author":"D Sun","year":"1996","unstructured":"Sun D, Batta R (1996) Scheduling larger job shops: a decomposition approach. Int J Prod Res 34(7):2019\u20132033","journal-title":"Int J Prod Res"},{"issue":"1","key":"134_CR24","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1080\/00207540110073000","volume":"40","author":"L Tang","year":"2002","unstructured":"Tang L, Luh PB, Liu J, Fang L (2002) Steel-making process scheduling using Lagrangian relaxation. Int J Prod Res 40(1):55\u201370","journal-title":"Int J Prod Res"},{"issue":"8","key":"134_CR25","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1287\/mnsc.33.8.1035","volume":"33","author":"AP Vepsalainen","year":"1987","unstructured":"Vepsalainen AP, Morton TE (1987) Priority rules for job shops with weighted tardy costs. Manage Sci 33(8):95\u2013103","journal-title":"Manage Sci"},{"issue":"1","key":"134_CR26","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.47.1.113","volume":"47","author":"SD Wu","year":"1999","unstructured":"Wu SD, Byeon ES, Storer RH (1999) A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness. Oper Res 47(1):113\u2013124","journal-title":"Oper Res"},{"issue":"1","key":"134_CR27","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.cor.2006.02.024","volume":"35","author":"CY Zhang","year":"2008","unstructured":"Zhang CY, Li PG, Rao YQ, Guan ZL (2008) A very fast TS\/SA algorithm for the job shop scheduling problem. Comput Oper Res 35(1):282\u2013294","journal-title":"Comput Oper Res"},{"key":"134_CR28","doi-asserted-by":"crossref","unstructured":"Zhou H, Cheung W, Leung LC (2008) Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm. Eur J Oper Res. doi: 10.1016\/j.ejor.2007.10.063","DOI":"10.1016\/j.ejor.2007.10.063"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-008-0134-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-008-0134-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-008-0134-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:25:42Z","timestamp":1559154342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-008-0134-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,20]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["134"],"URL":"https:\/\/doi.org\/10.1007\/s10489-008-0134-y","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,20]]}}}