乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T14:11:04Z","timestamp":1725977464558},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319912523"},{"type":"electronic","value":"9783319912530"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-91253-0_51","type":"book-chapter","created":{"date-parts":[[2018,5,10]],"date-time":"2018-05-10T14:55:13Z","timestamp":1525964113000},"page":"548-560","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Mathematical Model and a Firefly Algorithm for an Extended Flexible Job Shop Problem with Availability Constraints"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-0718-0019","authenticated-orcid":false,"given":"Willian","family":"Tessaro Lunardi","sequence":"first","affiliation":[]},{"given":"Luiz Henrique","family":"Cherri","sequence":"additional","affiliation":[]},{"given":"Holger","family":"Voos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,11]]},"reference":[{"issue":"4","key":"51_CR1","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.future.2009.10.004","volume":"26","author":"A Bagheri","year":"2010","unstructured":"Bagheri, A., Zandieh, M., Mahdavi, I., Yazdani, M.: An artificial immune algorithm for the flexible job-shop scheduling problem. Future Gener. Comput. Syst. 26(4), 533\u2013541 (2010)","journal-title":"Future Gener. Comput. Syst."},{"issue":"3","key":"51_CR2","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1016\/j.apm.2012.03.020","volume":"37","author":"Y Demir","year":"2013","unstructured":"Demir, Y., \u0130\u015fleyen, S.K.: Evaluation of mathematical models for flexible job-shop scheduling problems. Appl. Math. Model. 37(3), 977\u2013988 (2013)","journal-title":"Appl. Math. Model."},{"issue":"4","key":"51_CR3","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s10845-005-0021-x","volume":"17","author":"J Gao","year":"2006","unstructured":"Gao, J., Gen, M., Sun, L.: Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm. J. Intell. Manuf. 17(4), 493\u2013507 (2006)","journal-title":"J. Intell. Manuf."},{"issue":"21","key":"51_CR4","doi-asserted-by":"publisher","first-page":"7652","DOI":"10.1016\/j.eswa.2015.06.004","volume":"42","author":"KZ Gao","year":"2015","unstructured":"Gao, K.Z., Suganthan, P.N., Chua, T.J., Chong, C.S., Cai, T.X., Pan, Q.K.: A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion. Expert Syst. Appl. 42(21), 7652\u20137663 (2015)","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"51_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0378-4754(02)00019-8","volume":"60","author":"I Kacem","year":"2002","unstructured":"Kacem, I., Hammadi, S., Borne, P.: Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math. Comput. Simul. 60(3), 245\u2013276 (2002)","journal-title":"Math. Comput. Simul."},{"issue":"9","key":"51_CR6","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1007\/s00170-010-3140-2","volume":"55","author":"JQ Li","year":"2011","unstructured":"Li, J.Q., Pan, Q.K., Gao, K.Z.: Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems. Int. J. Adv. Manuf. Technol. 55(9), 1159\u20131169 (2011)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"Lunardi, W.T., Voos, H.: Comparative study of genetic and discrete firefly algorithm for combinatorial optimization. In: 33rd ACM\/SIGAPP Symposium on Applied Computing, Pau, France, 9\u201313 April 2018 (2018)","DOI":"10.1145\/3167132.3167160"},{"issue":"6","key":"51_CR8","doi-asserted-by":"publisher","first-page":"1539","DOI":"10.1016\/j.apm.2009.09.002","volume":"34","author":"C \u00d6zg\u00fcven","year":"2010","unstructured":"\u00d6zg\u00fcven, C., \u00d6zbak\u0131r, L., Yavuz, Y.: Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Appl. Math. Model. 34(6), 1539\u20131548 (2010)","journal-title":"Appl. Math. Model."},{"issue":"3","key":"51_CR9","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1016\/j.cie.2010.05.016","volume":"59","author":"S Wang","year":"2010","unstructured":"Wang, S., Yu, J.: An effective heuristic for flexible job-shop scheduling problem with maintenance activities. Comput. Ind. Eng. 59(3), 436\u2013447 (2010)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"51_CR10","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.cie.2005.01.018","volume":"48","author":"W Xia","year":"2005","unstructured":"Xia, W., Wu, Z.: An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput. Ind. Eng. 48(2), 409\u2013425 (2005)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"51_CR11","doi-asserted-by":"publisher","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.: Multi-objective flexible job shop schedule: design and evaluation by simulation modeling. Appl. Soft Comput. 9(1), 362\u2013376 (2009)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"51_CR12","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1109\/TASE.2013.2274517","volume":"12","author":"Y Yuan","year":"2015","unstructured":"Yuan, Y., Xu, H.: Multiobjective flexible job shop scheduling using memetic algorithms. IEEE Trans. Autom. Sci. Eng. 12(1), 336\u2013353 (2015)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"4","key":"51_CR13","doi-asserted-by":"publisher","first-page":"1309","DOI":"10.1016\/j.cie.2008.07.021","volume":"56","author":"G Zhang","year":"2009","unstructured":"Zhang, G., Shao, X., Li, P., Gao, L.: An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput. Ind. Eng. 56(4), 1309\u20131318 (2009)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"51_CR14","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.ijpe.2007.01.014","volume":"112","author":"N Zribi","year":"2008","unstructured":"Zribi, N., El Kamel, A., Borne, P.: Minimizing the makespan for the MPM job-shop with availability constraints. Int. J. Prod. Econ. 112(1), 151\u2013160 (2008)","journal-title":"Int. J. Prod. Econ."}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91253-0_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:42:39Z","timestamp":1710340959000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-91253-0_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319912523","9783319912530"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91253-0_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"11 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence and Soft Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zakopane","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaisc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/icaisc.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}