乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T22:09:08Z","timestamp":1726092548033},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,1,19]],"date-time":"2014-01-19T00:00:00Z","timestamp":1390089600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10845-014-0869-8","type":"journal-article","created":{"date-parts":[[2014,1,18]],"date-time":"2014-01-18T21:45:18Z","timestamp":1390081518000},"page":"363-374","source":"Crossref","is-referenced-by-count":123,"title":["Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives"],"prefix":"10.1007","volume":"27","author":[{"given":"K. Z.","family":"Gao","sequence":"first","affiliation":[]},{"given":"P. N.","family":"Suganthan","sequence":"additional","affiliation":[]},{"given":"Q. K.","family":"Pan","sequence":"additional","affiliation":[]},{"given":"T. J.","family":"Chua","sequence":"additional","affiliation":[]},{"given":"T. X.","family":"Cai","sequence":"additional","affiliation":[]},{"given":"C. S.","family":"Chong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,1,19]]},"reference":[{"key":"869_CR1","unstructured":"Barnes, J. W., Chambers, J. B. (1996). Flexible job shop scheduling by tabu search. Graduate program in operations research and industrial engineering. The University of Texas at Austin; Technical Report Series: ORP96-09; http:\/\/ww.cs.utexas.edu\/users\/jbc\/ ."},{"issue":"3","key":"869_CR2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte, P. (1993). Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research, 41(3), 157\u2013183.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"869_CR3","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Brucker","year":"1990","unstructured":"Brucker, P., & Schlie, R. (1990). Job-shop scheduling with multi-purpose machines. Computing, 45(4), 369\u2013375.","journal-title":"Computing"},{"issue":"3","key":"869_CR4","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1018930406487","volume":"70","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"1997","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s, S., & Paulli, J. (1997). An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Annals of Operations Research, 70(3), 281\u2013306.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"869_CR5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0377-2217(97)00019-2","volume":"109","author":"E Demirkol","year":"1998","unstructured":"Demirkol, E., Mehta, S., & Uzsoy, R. (1998). Benchmark for shop scheduling problems. European Journal Operational Research, 109(1), 137\u2013141.","journal-title":"European Journal Operational Research"},{"issue":"1","key":"869_CR6","first-page":"21","volume":"1","author":"P Fattahi","year":"2009","unstructured":"Fattahi, P. (2009). A hybrid multi objective algorithm for flexible job shop scheduling. International Journal of Mathematical and Statistical Sciences, 1(1), 21\u201326.","journal-title":"International Journal of Mathematical and Statistical Sciences"},{"issue":"9","key":"869_CR7","doi-asserted-by":"crossref","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"J Gao","year":"2008","unstructured":"Gao, J., Sun, L., & Gen, M. (2008). A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers and Operations Research, 35(9), 2892\u20132907.","journal-title":"Computers and Operations Research"},{"issue":"5\u20138","key":"869_CR8","first-page":"683","volume":"56","author":"KZ Gao","year":"2011","unstructured":"Gao, K. Z., Pan, Q. K., & Li, J. Q. (2011). Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion. International Journal of Advanced Manufacturing Technology, 56(5\u20138), 683\u2013692.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"2","key":"869_CR9","doi-asserted-by":"crossref","first-page":"1250012","DOI":"10.1142\/S0217595912500121","volume":"29","author":"KZ Gao","year":"2012","unstructured":"Gao, K. Z., Pan, Q. K., Li, J. Q., et al. (2012). A hybrid harmony search algorithm for the no-wait flow shop scheduling problems. Asia-Pacific Journal of Operational Research, 29(2), 1250012.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"2","key":"869_CR10","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flow hop and job shop scheduling. Mathematics of Operations Research, 1(2), 117\u2013129.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"869_CR11","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001). A new heuristic optimization algorithm: Harmony search. Simulation, 76(2), 60\u201368.","journal-title":"Simulation"},{"key":"869_CR12","first-page":"316","volume":"4507","author":"ZW Geem","year":"2007","unstructured":"Geem, Z. W. (2007). Optimal scheduling of multiple dam system using harmony search algorithm. LNCS, 4507, 316\u2013323.","journal-title":"LNCS"},{"key":"869_CR13","first-page":"1","volume-title":"Genetic algorithms & engineering optimization","author":"M Gen","year":"2000","unstructured":"Gen, M., & Cheng, R. (2000). Genetic algorithms & engineering optimization (pp. 1\u201330). NewYork: Wiley."},{"issue":"4","key":"869_CR14","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/s10845-008-0150-0","volume":"20","author":"M Gholami","year":"2009","unstructured":"Gholami, M., & Zandieh, M. (2009). Integrating simulation and genetic algorithm to scheduling a dynamic flexible job shop. Journal of Intelligent Manufacturing, 20(4), 481\u2013498.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"2","key":"869_CR15","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","volume":"113","author":"AS Jain","year":"1998","unstructured":"Jain, A. S., & Meeran, S. (1998). Deterministic job-shop scheduling: Past, present and future. European Journal of Operational Research, 113(2), 390\u2013434.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"869_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TSMCC.2002.1009117","volume":"32","author":"I Kacem","year":"2002","unstructured":"Kacem, I., Hammadi, S., & Borne, P. (2002). Approach by localization and multi-objective evolutionary optimization for flexible job shop scheduling problems. IEEE Transaction on System, Man, and Cybernetics, Part C, 32(1), 1\u201313.","journal-title":"IEEE Transaction on System, Man, and Cybernetics, Part C"},{"issue":"7","key":"869_CR17","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1080\/03052150500211895","volume":"37","author":"KS Lee","year":"2005","unstructured":"Lee, K. S., Geem, Z. W., Lee, S. H., & Bae, K. W. (2005). The harmony search heuristic algorithm for discrete structural optimization. Engineering Optimization, 37(7), 663\u2013684.","journal-title":"Engineering Optimization"},{"issue":"4","key":"869_CR18","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1016\/j.cie.2010.07.014","volume":"59","author":"J Li","year":"2010","unstructured":"Li, J., Pan, Q., & Liang, Y.-C. (2010). An effective hybrid tabu search algorithm for multi-objective flexible job shop scheduling problems. Computer & Industrial Engineering, 59(4), 647\u2013662.","journal-title":"Computer & Industrial Engineering"},{"key":"869_CR19","doi-asserted-by":"crossref","unstructured":"Li, J.-Q., Pan, Q.-K., Suganthan, P. N., & Chua, T. J. (2011a). A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem. International Journal of Advanced Manufacturing Technology, 52(5\u20138), 683\u2013697.","DOI":"10.1007\/s00170-010-2743-y"},{"issue":"9\u201312","key":"869_CR20","first-page":"1159","volume":"55","author":"J-Q Li","year":"2011","unstructured":"Li, J.-Q., Pan, Q.-K., & Gao, K.-Z. (2011b). Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems. International Journal of Advanced Manufacturing Technology, 55(9\u201312), 1159\u20131169.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"2","key":"869_CR21","doi-asserted-by":"crossref","first-page":"174","DOI":"10.15837\/ijccc.2007.2.2350","volume":"2","author":"N Liouane","year":"2007","unstructured":"Liouane, N., Saad, I., Hammadi, S., & Borne, P. (2007). Ant systems & local search optimization for flexible job-shop scheduling production. International Journal of Computers, Communications & Control, 2(2), 174\u2013184.","journal-title":"International Journal of Computers, Communications & Control"},{"issue":"2","key":"869_CR22","doi-asserted-by":"crossref","first-page":"1567","DOI":"10.1016\/j.amc.2006.11.033","volume":"188","author":"M Mahdavi","year":"2007","unstructured":"Mahdavi, M., Fesanghary, M., & Damangir, E. (2007). An improved harmony search algorithm for solving optimization problems. Applied Mathematics and Computation, 188(2), 1567\u20131579.","journal-title":"Applied Mathematics and Computation"},{"issue":"1","key":"869_CR23","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y","volume":"3","author":"M Mastrolilli","year":"2000","unstructured":"Mastrolilli, M., & Gambardella, L. M. (2000). Effective neighborhood functions for the flexible job shop problem. Journal of Scheduling, 3(1), 3\u201320.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"869_CR24","first-page":"371","volume":"198","author":"MGH Omran","year":"2008","unstructured":"Omran, M. G. H., & Mahdavi, M. (2008). Global-best harmony search. Applied Mathematics and Computation, 198(2), 371\u2013378.","journal-title":"Applied Mathematics and Computation"},{"issue":"4","key":"869_CR25","doi-asserted-by":"crossref","first-page":"3252","DOI":"10.1016\/j.eswa.2010.08.111","volume":"38","author":"QK Pan","year":"2011","unstructured":"Pan, Q. K., Suganthan, P. N., Liang, J. J., & Tasgetiren, M. F. (2011). A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem. Expert System with Application, 38(4), 3252\u20133259.","journal-title":"Expert System with Application"},{"issue":"10","key":"869_CR26","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F Pezzella","year":"2008","unstructured":"Pezzella, F., Morganti, G., & Ciaschetti, G. (2008). A genetic algorithm for the flexible job-shop scheduling problem. Computers & Operations Research, 35(10), 3202\u20133212.","journal-title":"Computers & Operations Research"},{"key":"869_CR27","volume-title":"Scheduling theory, algorithms, and systems","author":"M Pinedo","year":"2002","unstructured":"Pinedo, M. (2002). Scheduling theory, algorithms, and systems. Englewood Cliffs, NJ: Prentice-Hall."},{"issue":"1","key":"869_CR28","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/B:JIMS.0000010078.30713.e9","volume":"15","author":"CR Scrich","year":"2004","unstructured":"Scrich, C. R., Armentano, V. A., & Laguna, M. (2004). Tardiness minimization in a flexible job shop: A tabu search approach. Journal of Intelligent Manufacturing, 15(1), 103\u2013115.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"23","key":"869_CR29","doi-asserted-by":"crossref","first-page":"6963","DOI":"10.1080\/00207543.2010.526016","volume":"49","author":"G Vilcot","year":"2011","unstructured":"Vilcot, G., & Billaut, J.-C. (2011). A tabu search algorithm for solving a multi-criteria flexible job shop scheduling problem. International Journal of Production Research, 49(23), 6963\u20136980.","journal-title":"International Journal of Production Research"},{"key":"869_CR30","doi-asserted-by":"crossref","unstructured":"Wang, L., Pan, Q. K., & Tasgetiren, M. F. (2010). Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms. Expert System with Application, 37(12), 7929\u20137936.","DOI":"10.1016\/j.eswa.2010.04.042"},{"key":"869_CR31","doi-asserted-by":"crossref","unstructured":"Wang, L., Zhou, G., Xu, Y., Wang, S., & Liu, M. (2012a). An effective artificial bee colony algorithm for the flexible job shop scheduling problem. International Journal of Advanced Manufacturing Technology, 60(1\u20134), 303\u2013315.","DOI":"10.1007\/s00170-011-3610-1"},{"issue":"9\u201312","key":"869_CR32","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1007\/s00170-011-3665-z","volume":"60","author":"L Wang","year":"2012","unstructured":"Wang, L., Zhou, G., Xu, Y., & Liu, M. (2012b). An enhanced Pareto-based artificial bee colony algorithm for the multi-objective flexible job shop scheduling. International Journal of Advanced Manufacturing Technology, 60(9\u201312), 1111\u20131123.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"2","key":"869_CR33","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1109\/TSMCB.2004.842412","volume":"35","author":"Z Wu","year":"2005","unstructured":"Wu, Z., & Weng, M. X. (2005). Multi-agent scheduling method with earliness and tardiness objectives in flexible job shops. IEEE Transactions on System, Man, and Cybernetics-Part B: Cybernetics, 35(2), 293\u2013301.","journal-title":"IEEE Transactions on System, Man, and Cybernetics-Part B: Cybernetics"},{"issue":"2","key":"869_CR34","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.cie.2005.01.018","volume":"48","author":"WJ Xia","year":"2005","unstructured":"Xia, W. J., & Wu, Z. M. (2005). An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers & Industrial Engineering, 48(2), 409\u2013425.","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"869_CR35","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s10845-008-0216-z","volume":"20","author":"LN Xing","year":"2009","unstructured":"Xing, L. N., Chen, Y. W., & Yang, K. W. (2009a). An efficient search method for multi-objective flexible job shop scheduling problems. Journal of Intelligent Manufacturing, 20(3), 283\u2013293.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"1","key":"869_CR36","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/j.asoc.2008.04.013","volume":"9","author":"LN Xing","year":"2009","unstructured":"Xing, L. N., Chen, Y. W., & Yang, K. W. (2009b). Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling. Applied Soft Computing, 9(1), 362\u2013376.","journal-title":"Applied Soft Computing"},{"issue":"2","key":"869_CR37","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1016\/j.enconman.2010.08.016","volume":"52","author":"P Yadav","year":"2011","unstructured":"Yadav, P., Kumar, R., Panda, S. K., & Chang, C. S. (2011). An improved harmony search algorithm for optimal scheduling of the diesel generators in oil rig platforms. Energy Conversion Management, 52(2), 893\u2013902.","journal-title":"Energy Conversion Management"},{"issue":"11","key":"869_CR38","doi-asserted-by":"crossref","first-page":"3229","DOI":"10.1016\/j.cor.2005.12.002","volume":"34","author":"CY Zhang","year":"2007","unstructured":"Zhang, C. Y., Li, P. G., Guan, Z. L., & Rao, Y. Q. (2007). A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Computers & Operations Research, 34(11), 3229\u20133242.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"869_CR39","doi-asserted-by":"crossref","first-page":"1309","DOI":"10.1016\/j.cie.2008.07.021","volume":"56","author":"GH Zhang","year":"2009","unstructured":"Zhang, G. H., Shao, X. Y., Li, P. G., & Gao, L. (2009). An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Computers & Industrial Engineering, 56(4), 1309\u20131318.","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"869_CR40","doi-asserted-by":"crossref","first-page":"3563","DOI":"10.1016\/j.eswa.2010.08.145","volume":"38","author":"G Zhang","year":"2011","unstructured":"Zhang, G., Gao, L., & Shi, Y. (2011). An effective genetic algorithm for the flexible job-shop scheduling problem. Expert System with Application, 38(4), 3563\u20133573.","journal-title":"Expert System with Application"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-014-0869-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-014-0869-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-014-0869-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:12:00Z","timestamp":1559268720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-014-0869-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,19]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["869"],"URL":"https:\/\/doi.org\/10.1007\/s10845-014-0869-8","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,19]]}}}