{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:29:45Z","timestamp":1743118185026,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319959290"},{"type":"electronic","value":"9783319959306"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-95930-6_62","type":"book-chapter","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T06:12:40Z","timestamp":1530771160000},"page":"618-627","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid Discrete Teaching-Learning-Based Optimization Algorithm for Solving Parallel Machine Scheduling Problem with Multiple Constraints"],"prefix":"10.1007","author":[{"given":"Yu-Jie","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,6]]},"reference":[{"key":"62_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M Pinedo","year":"2012","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Springer, Heidelberg (2012)"},{"issue":"9\u201312","key":"62_CR2","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.1007\/s00170-014-6390-6","volume":"76","author":"O Avalos-Rosales","year":"2015","unstructured":"Avalos-Rosales, O., Angel-Bello, F., Alvarez, A.: Efficient metaheuristic algorithm and re-formulations for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times. Int. J. Adv. Manuf. Technol. 76(9\u201312), 1705\u20131718 (2015)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"C","key":"62_CR3","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.neucom.2014.06.091","volume":"163","author":"ROM Diana","year":"2015","unstructured":"Diana, R.O.M.: An immune-inspired algorithm for an unrelated parallel machines\u2019 scheduling problem with sequence and machine dependent setup-times for makespan minimisation. Neurocomputing 163(C), 94\u2013105 (2015)","journal-title":"Neurocomputing"},{"key":"62_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.cor.2014.08.002","volume":"53","author":"V Sels","year":"2015","unstructured":"Sels, V., Coelho, J., Dias, A.M., et al.: Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem. Comput. Oper. Res. 53, 107\u2013117 (2015)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"62_CR5","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10951-014-0397-6","volume":"19","author":"A Bitar","year":"2016","unstructured":"Bitar, A., Yugma, C., Roussel, R.: A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing. J. Sched. 19(4), 367\u2013376 (2016)","journal-title":"J. Sched."},{"issue":"C","key":"62_CR6","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.cie.2015.02.029","volume":"85","author":"CM Joo","year":"2015","unstructured":"Joo, C.M., Kim, B.S.: Hybrid genetic algorithms with dispatching rules for unrelated parallel machine scheduling with setup time and production availability. Comput. Ind. Eng. 85(C), 102\u2013109 (2015)","journal-title":"Comput. Ind. Eng."},{"issue":"9\u201312","key":"62_CR7","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1007\/s00170-011-3442-z","volume":"58","author":"P Damodaran","year":"2012","unstructured":"Damodaran, P., Diyadawagamage, D.A., Ghrayeb, O.: A particle swarm optimization algorithm for minimizing makespan of nonidentical parallel batch processing machines. Int. J. Adv. Manuf. Technol. 58(9\u201312), 1131\u20131140 (2012)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"3","key":"62_CR8","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.cad.2010.12.015","volume":"43","author":"RV Rao","year":"2011","unstructured":"Rao, R.V., Savsani, V.J., Vakharia, D.P.: Teaching- learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput. Aided Des. 43(3), 303\u2013315 (2011)","journal-title":"Comput. Aided Des."},{"key":"62_CR9","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.knosys.2016.06.011","volume":"107","author":"SW Shao","year":"2016","unstructured":"Shao, S.W., Pi, D.C., Shao, Z.: A hybrid discrete optimization algorithm based on teaching\u2013probabilistic learning mechanism for no-wait flow shop scheduling. Knowl. Based Syst. 107, 219\u2013234 (2016)","journal-title":"Knowl. Based Syst."},{"key":"62_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.asoc.2017.08.020","volume":"61","author":"SW Shao","year":"2017","unstructured":"Shao, S.W., Pi, D.C., Shao, Z.: An extended teaching-learning based optimization algorithm for solving no-wait flow shop scheduling problem. Appl. Soft Comput. 61, 193\u2013210 (2017)","journal-title":"Appl. Soft Comput."},{"key":"62_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.engappai.2014.09.015","volume":"37","author":"JQ Li","year":"2015","unstructured":"Li, J.Q., Pan, Q.K., Mao, K.: A discrete teaching-learning-based optimization algorithm for realistic flowshop rescheduling problems. Eng. Appl. Artif. Intell. 37, 279\u2013292 (2015)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"11","key":"62_CR12","first-page":"49","volume":"31","author":"O Abdoun","year":"2011","unstructured":"Abdoun, O., Abouchabaka, J.: A Comparative study of adaptive crossover operators for genetic algorithms to resolve the traveling salesman problem. Comput. Sci. 31(11), 49\u201357 (2011)","journal-title":"Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-95930-6_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:21:00Z","timestamp":1710246060000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-95930-6_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319959290","9783319959306"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95930-6_62","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":"6 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuhan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"15 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ic-ic.tongji.edu.cn\/2018\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"LOD","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"632","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"275","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.46","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}