{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T19:07:54Z","timestamp":1724440074290},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,8,26]],"date-time":"2017-08-26T00:00:00Z","timestamp":1503705600000},"content-version":"vor","delay-in-days":237,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2017]]},"DOI":"10.1016\/j.procs.2017.08.174","type":"journal-article","created":{"date-parts":[[2017,9,2]],"date-time":"2017-09-02T06:33:50Z","timestamp":1504334030000},"page":"81-90","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":26,"special_numbering":"C","title":["Multi Agent model based on Chemical Reaction Optimization with Greedy algorithm for Flexible Job shop Scheduling Problem"],"prefix":"10.1016","volume":"112","author":[{"given":"Bilel","family":"Marzouki","sequence":"first","affiliation":[]},{"given":"Olfa","family":"Belkahla Driss","sequence":"additional","affiliation":[]},{"given":"Khaled","family":"Gh\u00e9dira","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.procs.2017.08.174_bib0001","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The Complexity of Flow-shop and Job-shop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/j.procs.2017.08.174_bib0002","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF02238804","article-title":"Job-shop scheduling with multipurpose machines","volume":"45","author":"Bruker","year":"1990","journal-title":"Computing"},{"issue":"1-4","key":"10.1016\/j.procs.2017.08.174_bib0003","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","article-title":"Routing and scheduling in a flexible job shop by tabu search","volume":"4","author":"Brandimarte","year":"1993","journal-title":"Annals of Operations Research"},{"issue":"4","key":"10.1016\/j.procs.2017.08.174_bib0004","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01719451","article-title":"Tabu search for the job-shop scheduling problem with multi-purpose machines","volume":"15","author":"Hurink","year":"1994","journal-title":"Operational Research Spektr"},{"key":"10.1016\/j.procs.2017.08.174_bib0005","unstructured":"Chambers, J., Barnes, J. Classical and Flexible Job Shop Scheduling by Tabu Search. PhD thesis University of Texas, Austin, USA 1996."},{"issue":"5-8","key":"10.1016\/j.procs.2017.08.174_bib0006","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1007\/s00170-010-2743-y","article-title":"A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem","volume":"52","author":"Li","year":"2011","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"9","key":"10.1016\/j.procs.2017.08.174_bib0007","doi-asserted-by":"crossref","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","article-title":"A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems","volume":"35","author":"Gao","year":"2008","journal-title":"Computers & Operationals Research"},{"issue":"1","key":"10.1016\/j.procs.2017.08.174_bib0008","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TSMCC.2002.1009117","article-title":"Approach by Localization and Multi-Objective Evolutionary Optimization for Flexible Job Shop Scheduling Problems","volume":"32","author":"Kacem","year":"2002","journal-title":"IEEE Transactions Systems Man and Cybernetics"},{"issue":"12","key":"10.1016\/j.procs.2017.08.174_bib0009","first-page":"122","article-title":"Modified Genetic Algorithm for Flexible Job-Shop Scheduling Problems","author":"Wannaporn","year":"2012","journal-title":"Procedia Computer Science"},{"issue":"13","key":"10.1016\/j.procs.2017.08.174_bib00010","first-page":"3905","volume":"52","author":"Demir","year":"2014","journal-title":"An effective genetic algorithm for flexible job-shop scheduling with overlapping in operations"},{"key":"10.1016\/j.procs.2017.08.174_bib00011","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10845-007-0026-8","article-title":"Mathematical modeling and heuristic approaches to flexible job shop scheduling problems","volume":"18","author":"Fattahi","year":"2007","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"4","key":"10.1016\/j.procs.2017.08.174_bib00012","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.future.2009.10.004","article-title":"An artificial immune algorithm for the flexible job-shop scheduling problem","volume":"26","author":"Bagheri","year":"2010","journal-title":"Future Generation Computer Systems"},{"issue":"13","key":"10.1016\/j.procs.2017.08.174_bib00013","doi-asserted-by":"crossref","first-page":"3259","DOI":"10.1016\/j.asoc.2013.02.013","article-title":"A hybrid harmony search algorithm for the flexible job shop scheduling problem","author":"Yuan","year":"2013","journal-title":"Applied soft computing"},{"issue":"20","key":"10.1016\/j.procs.2017.08.174_bib00014","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.procs.2013.09.245","article-title":"A hybrid artificial bee colony algorithm with local search for flexible job-shop scheduling problem","author":"Thammano","year":"2013","journal-title":"Procedia computer science"},{"issue":"2","key":"10.1016\/j.procs.2017.08.174_bib00015","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/s10458-008-9031-3","article-title":"New local diversification techniques for flexible job shop scheduling problem with a multi-agent approach","volume":"17","author":"Ennigrou","year":"2008","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"issue":"60","key":"10.1016\/j.procs.2017.08.174_bib00016","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.procs.2015.08.107","article-title":"Hybrid Metaheuristics within a Holonic Multiagent Model for the Flexible Job Shop Problem","author":"Nouri","year":"2015","journal-title":"Procedia Computer Science"},{"issue":"1","key":"10.1016\/j.procs.2017.08.174_bib00017","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-3-319-24069-5_3","article-title":"Multi Agent model based on Chemical Reaction Optimization for Flexible Job Shop Problem","volume":"9329","author":"Marzouki","year":"2015","journal-title":"International Conference on Computational Collective Intelligence"},{"issue":"102","key":"10.1016\/j.procs.2017.08.174_bib00018","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1016\/j.cie.2016.02.024","article-title":"Simultaneous scheduling of machines and transport robots in flexible job shop environment using hybrid metaheuristics based on clustered holonic mutliagent model","author":"Nouri","year":"2016","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"10.1016\/j.procs.2017.08.174_bib00019","doi-asserted-by":"crossref","first-page":"808828","DOI":"10.1007\/s10489-016-0786-y","article-title":"Hybrid metaheuristics for scheduling of machines and transport robots in job shop environment","volume":"45","author":"Nouri","year":"2016","journal-title":"Applied Intelligence"},{"key":"10.1016\/j.procs.2017.08.174_bib00020","unstructured":"Marzouki, B., Belkahla Driss, O. Hybridized Chemical Reaction Optimization with Tabu Search for Flexible Job shop Scheduling Problem. IEEE International Conference on Control Engineering & Information Technology CEIT, December 16-18, 2016."},{"issue":"3","key":"10.1016\/j.procs.2017.08.174_bib00021","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1109\/TEVC.2009.2033580","article-title":"Chemical-reaction-inspired metaheuristic for optimization","volume":"14","author":"Lam","year":"2010","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.1016\/j.procs.2017.08.174_bib00022","doi-asserted-by":"crossref","unstructured":"Jin, Xu., Lam, A., li, V. Chemical Reaction Optimization for the Grid Scheduling Problem. IEEE International Conference on Communications 2010; doi:10.1109\/ICC.2010.5502406.","DOI":"10.1109\/ICC.2010.5502406"},{"key":"10.1016\/j.procs.2017.08.174_bib00023","doi-asserted-by":"crossref","unstructured":"Bargaoui, H., Belkahla Driss, O., Ghedira, K. Minimizing Makespan in Multi-Factory Flow Shop Problem Using a Chemical Reaction Meta-heuristic IEEE Congress on Evolutionary Computation 2016; DOI: 10.1109\/CEC.2016.7744158.","DOI":"10.1109\/CEC.2016.7744158"},{"key":"10.1016\/j.procs.2017.08.174_bib00024","doi-asserted-by":"crossref","first-page":"2896","DOI":"10.1016\/j.asoc.2012.04.012","article-title":"Chemical-reaction optimization for flexible job-shop scheduling problems with maintenance activity","volume":"12","author":"Jun","year":"2012","journal-title":"Applied Soft Computing"},{"issue":"11","key":"10.1016\/j.procs.2017.08.174_bib00025","first-page":"177","article-title":"Greedy Algorithm Solution of Flexible Flow Shop Scheduling Problem","volume":"9","author":"Xiaofeng","year":"2009","journal-title":"IJCSNS International Journal of Computer Science and Network Security"},{"issue":"3","key":"10.1016\/j.procs.2017.08.174_bib00026","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02936356","article-title":"A greedy algorithm for scheduling tasks on production lines","volume":"1","author":"Katsavounis","year":"2001","journal-title":"Operational Research"},{"key":"10.1016\/j.procs.2017.08.174_bib00027","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.omega.2010.07.007","article-title":"An iterated greedy algorithm for the flowshop scheduling problem with blocking","volume":"39","author":"Ribas","year":"2011","journal-title":"Omega"},{"key":"10.1016\/j.procs.2017.08.174_bib00028","doi-asserted-by":"crossref","unstructured":"Saad, I., Boukef, H., Borne, P. The comparison of criteria aggregative approaches for the multi-objective optimization of flexible job-shop scheduling problems. Conference on Management and Control of Production and Logistics 2007; (3):603-610.","DOI":"10.3182\/20070927-4-RO-3905.00100"}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050917315314?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050917315314?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T22:43:44Z","timestamp":1570056224000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877050917315314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":28,"alternative-id":["S1877050917315314"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2017.08.174","relation":{},"ISSN":["1877-0509"],"issn-type":[{"value":"1877-0509","type":"print"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Multi Agent model based on Chemical Reaction Optimization with Greedy algorithm for Flexible Job shop Scheduling Problem","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2017.08.174","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}