乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T09:16:56Z","timestamp":1709284616223},"reference-count":33,"publisher":"Hindawi Limited","license":[{"start":{"date-parts":[[2010,12,2]],"date-time":"2010-12-02T00:00:00Z","timestamp":1291248000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Advances in Artificial Intelligence"],"published-print":{"date-parts":[[2010,12,2]]},"abstract":"A multiobjective optimization problem which focuses on parallel machines scheduling is considered. This problem consists of scheduling independent jobs on identical parallel machines with release dates, \n\t\t\t\t\t\tdue dates, and sequence-dependent setup times. The preemption of jobs is forbidden. The aim is to minimize \n\t\t\t\t\t\ttwo different objectives: makespan and total tardiness. The contribution of this paper is to propose first a new mathematical \n\t\t\t\t\t\tmodel for this specific problem. Then, since this problem is NP hard in the strong sense, two well-known approximated methods, \n\t\t\t\t\t\tNSGA-II and SPEA-II, are adopted to solve it. Experimental results show the advantages of NSGA-II for the \n\t\t\t\t\t\tstudied problem. An exact method is then applied to be compared with NSGA-II algorithm in order to prove the efficiency of \n\t\t\t\t\t\tthe former. Experimental results show the advantages of NSGA-II for the studied problem. Computational experiments show that on \n\t\t\t\t\t\tall the tested instances, our NSGA-II algorithm was able to get the optimal solutions.<\/jats:p>","DOI":"10.1155\/2010\/943050","type":"journal-article","created":{"date-parts":[[2010,12,2]],"date-time":"2010-12-02T19:35:48Z","timestamp":1291318548000},"page":"1-10","source":"Crossref","is-referenced-by-count":7,"title":["A Multiobjective Optimization Approach to Solve a Parallel Machines Scheduling Problem"],"prefix":"10.1155","volume":"2010","author":[{"given":"Xiaohui","family":"Li","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Technologie de Troyes, Institut Charles Delaunay, LOSI (UMR-STMR 6279), 12 Rue Marie Curie BP 2060 10010 Troyes Cedex, France"}]},{"given":"Lionel","family":"Amodeo","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Technologie de Troyes, Institut Charles Delaunay, LOSI (UMR-STMR 6279), 12 Rue Marie Curie BP 2060 10010 Troyes Cedex, France"}]},{"given":"Farouk","family":"Yalaoui","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Technologie de Troyes, Institut Charles Delaunay, LOSI (UMR-STMR 6279), 12 Rue Marie Curie BP 2060 10010 Troyes Cedex, France"}]},{"given":"Hicham","family":"Chehade","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Technologie de Troyes, Institut Charles Delaunay, LOSI (UMR-STMR 6279), 12 Rue Marie Curie BP 2060 10010 Troyes Cedex, France"}]}],"member":"98","reference":[{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"issue":"3","key":"10","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","volume":"47","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"7","year":"1998"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(00)00197-1"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1080\/07408170304382"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1002\/jos.103"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.07.008"},{"key":"47","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.02.022"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.05.005"},{"issue":"6","key":"27","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1287\/opre.42.6.1025","volume":"42","year":"1994","journal-title":"Operations Research"},{"issue":"2","key":"2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0925-5273(98)00034-6","volume":"55","year":"1998","journal-title":"International Journal of Production Economics"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-5273(01)00175-X"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.09.038"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.04.006"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.06.033"},{"key":"36","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/mnsc.16.1.93","volume":"16","year":"1969","journal-title":"Management Science"},{"issue":"8","key":"1","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1016\/S0305-0548(96)00080-9","volume":"24","year":"1997","journal-title":"Computers and Operations Research"},{"issue":"1","key":"5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0272-6963(82)90020-1","volume":"3","year":"1982","journal-title":"Journal of Operations Management"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.07.007"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1007\/BF01759923"},{"issue":"2","key":"26","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1162\/106365600568167","volume":"8","year":"2000","journal-title":"Evolutionary computation"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(02)00059-X"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2005.04.033"},{"issue":"3","key":"3","first-page":"428","volume":"16","year":"2008","journal-title":"Ingeniare"},{"issue":"3","key":"4","first-page":"183","volume":"8","year":"2006","journal-title":"Maderas: Ciencia y Tecnologia"},{"key":"15","volume-title":"Hybrid Job Shop and parallel machine scheduling problems: minimization of total tardiness criterion","year":"2007"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-008-1683-2"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2009.12.009"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2010.03.001"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-009-2419-7"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.10.017"},{"issue":"4","key":"45","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","year":"1999","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"37","series-title":"Lecture Notes in Computer Science","volume-title":"Constraint method-based evolutionary algorithm (CMEA) for multiobjective optimization","year":"2001"}],"container-title":["Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/archive\/2010\/943050.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/archive\/2010\/943050.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/archive\/2010\/943050.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T01:13:29Z","timestamp":1607476409000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/aai\/2010\/943050\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,2]]},"references-count":33,"alternative-id":["943050","943050"],"URL":"https:\/\/doi.org\/10.1155\/2010\/943050","relation":{},"ISSN":["1687-7470","1687-7489"],"issn-type":[{"value":"1687-7470","type":"print"},{"value":"1687-7489","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,2]]}}}