{"id":807,"date":"2019-04-01T11:39:29","date_gmt":"2019-04-01T11:39:29","guid":{"rendered":"http:\/\/grupo.us.es\/oindustrial\/?page_id=807"},"modified":"2022-12-07T11:42:52","modified_gmt":"2022-12-07T11:42:52","slug":"results","status":"publish","type":"page","link":"https:\/\/grupo.us.es\/oindustrial\/en\/research\/results\/","title":{"rendered":"Results"},"content":{"rendered":"\n<p> <\/p>\n\n\n\n<ul class=\"wp-block-list\"><li>Victor Fernandez-Viagas, Carla Talens, Jose M. Framinan, \u201cAssembly flowshop scheduling problem: Speed-up procedure and computational evaluation&#8221;, European Journal of Operational Research<ul><li>Problem-specific theoretical results (<a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2021\/09\/AppendixOnLine.pdf\">pdf <\/a>file).<\/li><\/ul><\/li><li>Talens C, Perez-Gonzalez P, Fernandez-Viagas V, Framinan JM, \u201cNew hard benchmark for the 2-stage multi-machine assembly scheduling problem: Design and computational evaluation\u201d, Computers and Industrial Engineering<ul><li>Detailed statistical results (<a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2020\/07\/Anova_Tukey_Test_Results.zip\">zip<\/a> file).<\/li><li>Benchmark B1 (<a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2021\/09\/Talens2021_B1.zip\">zip<\/a> file).<\/li><li>Benchmark B2 (<a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2021\/09\/Talens2021_B2.zip\">zip<\/a> file).<\/li><li>Upper bounds (<a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2021\/09\/Talens2021_UpperBounds.zip\">zip<\/a> file).<\/li><\/ul><\/li><li>Perez-Gonzalez P, Fernandez-Viagas V, Framinan JM, Permutation flowshop scheduling with periodic\u00a0maintenance and makespan objective, Report (2019)\u00a0<ul><li>Instances<ul><li>Big-size instances:<a href=\"http:\/\/mistic.heig-vd.ch\/taillard\/problemes.dir\/ordonnancement.dir\/ordonnancement.html\"> Taillard TestBed<\/a> \u00a0<\/li><li>Small-size instances (<a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/12\/SmallInstances.zip\">zip<\/a> file, MILP instances) 180 instances<\/li><li>Small-size instances (<a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/12\/CompleteEnumeration.zip\">zip<\/a> file, Complete enumeration instances) 600 instances<\/li><\/ul><\/li><li>Results <ul><li>MILP (<a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/12\/Results_MILP.xlsx\">xlsx<\/a>)<\/li><li>Complete Enumeration (<a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/12\/Results_CompleteEnumeration.zip\">zip<\/a> file)<\/li><li>Heuristics (<a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/12\/Results_Heur_smallinstances.xlsx\">xlsx<\/a> Small instances)<\/li><li>Heuristics\u00a0(<a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/12\/Results_BiginstancesTconstant.xlsx\">xlsx<\/a> Big instances T constant)<\/li><li>Heuristics\u00a0(<a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/12\/ResultsBigIstances_Tvariable.xlsx\">xlsx<\/a> Big instances T variable)  <\/li><\/ul><\/li><\/ul><\/li><li>Talens C, Fernandez-Viagas V, Perez-Gonzalez P, Framinan JM, \u201cNew efficient constructive heuristics for the two-stage multi-machine assembly scheduling problem\u201d, Computers &amp; Industrial Engineering<ul><li>Instances (zip file <a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/10\/instances_mma.zip\">instances_mma<\/a>)<\/li><li>Excel file with the best-so-far solutions for the instances (excel file <a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/10\/results_mma.xlsx\">results_mma<\/a>)<\/li><\/ul><\/li><li>Fernandez-Viagas V, Framinan JM, &#8220;Design of a testbed for hybrid flow shop scheduling with identical machines&#8221;, Computers and Industrial Engineering. <ul><li>Small-size instances (zip file,\u00a0<a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/04\/Small_Size_Instances.zip\">Small_Size_Instances<\/a>)<\/li><li>Big-size instances (zip file,\u00a0<a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/04\/Big_Size_Instances.zip\">Big_Size_Instances<\/a>)<\/li><li>Upper bounds (excel file,\u00a0<a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/04\/UpperBounds_01_April_2019.xlsx\">Upper_Bound.xlsx<\/a>) <\/li><\/ul><\/li><li>Frami\u00f1\u00e1n JM, Perez-Gonzalez P, \u201c<a href=\"https:\/\/www.researchgate.net\/publication\/308208809_New_approximate_algorithms_for_the_customer_order_scheduling_problem_with_total_completion_time_objective\">New approximate algorithms for the customer order scheduling problem with total completion time objective<\/a>\u201c, Computers &amp; Operations Research (2017), 78, pp. 181-192. <ul><li>Testbed instance 1 (small instances, zip file <a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/01\/testbed_1_s.zip\">testbed_1_s.zip<\/a>)<\/li><li>Testbed instance 1 (big instances, zip\u00a0 file <a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/01\/testbed_1_b.zip\">testbed_1_b.zip<\/a>)<\/li><li>Testbed instance 2 (small instances, zip\u00a0 file <a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/01\/testbed_2_s.zip\">testbed_2_s.zip<\/a>)<\/li><li>Testbed instance 2 (big instances, zip\u00a0 file <a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/01\/testbed_2_b.zip\">testbed_2_b.zip<\/a>)<\/li><li>Instructions referring to the format of the files: (first row) no_machines no_orders (second row) processing times for the first order on each machine (third row) processing times for the second order on each machine &#8230;. <\/li><li><a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/03\/best_known_results_big_instances.xlsx\">Excel file<\/a> with the best-so-far solutions for the big instances<\/li><li><a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/03\/best_known_results_small_instances.xlsx\">Excel file<\/a> with the best-so-far solutions for the small instances <\/li><\/ul><\/li><li>Framinan JM, Perez-Gonzalez P, <a href=\"https:\/\/idus.us.es\/xmlui\/bitstream\/handle\/11441\/68459\/TROI-2016-02_v04.pdf?sequence=1&amp;isAllowed=y\">Order Scheduling with Tardiness Objective: Improved Approximate Solutions<\/a>, 2018,\u00a0<em>European Journal of Operational Research<\/em>, 266 (3), 840-850. <ul><li>Testbed SMALL (2,700 instances) (small instances, zip file <a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2022\/12\/cos_tardiness_SMALL.zip\">cos_tardiness_SMALL.zip<\/a>)<\/li><li>Testbed BIG (1,440 instances) (big instances, zip file <a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/02\/cos_tardiness_BIG.zip\">cos_tardiness_BIG.zip<\/a>)<\/li><li>Instructions referring to the format of the files: (first row) no_machines no_orders (second row) processing times for the first order on each machine + due date of the first order (third row) processing times for the second order on each machine + due date of the second order &#8230;.  <\/li><li> <a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/04\/upper_bounds_SMALL.xlsx\">Excel file<\/a> with the best-so-far solutions for the testbed SMALL<\/li><li> <a href=\"http:\/\/grupo.us.es\/oindustrial\/wp-content\/uploads\/2019\/04\/upper_bounds_BIG.xlsx\">Excel file<\/a> with the best-so-far solutions for the testbed BIG <\/li><\/ul><\/li><li> Perez-Gonzalez P, Fernandez-Viagas V, Zamora Garc\u00eda M, Framinan JM, <a href=\"https:\/\/www.researchgate.net\/publication\/331944843_Constructive_Heuristics_for_the_Unrelated_Parallel_Machines_Scheduling_Problem_with_Machine_Eligibility_and_Setup_Times\">Constructive heuristics for the unrelated parallel machines scheduling problem with machine eligibility and setup times<\/a>,<em> Computers &amp; Industrial Engineering<\/em><br> (2019) 131, pp. 131-145 <ul><li><a href=\"http:\/\/ https:\/\/www.dropbox.com\/s\/p6wv4ybg2idkx2w\/Small_Size_Instances.rar?dl=0\">B<\/a><a href=\"https:\/\/www.dropbox.com\/s\/jt6iunqusx838di\/Big_Size_Instances.rar?dl=0\">ig-size instance<\/a><a href=\"http:\/\/ https:\/\/www.dropbox.com\/s\/p6wv4ybg2idkx2w\/Small_Size_Instances.rar?dl=0\">s<\/a> (rar file, Big_Size_Instances) 6000 instances<\/li><li><a href=\"https:\/\/www.dropbox.com\/s\/vkri4o6y8vhun0j\/Medium_Size_Instances.rar?dl=0\">Medium-size instances<\/a> (rar file, Medium_Size_Instances) 5760 instances<\/li><li><a href=\"https:\/\/www.dropbox.com\/s\/p6wv4ybg2idkx2w\/Small_Size_Instances.rar?dl=0\">Small-size instances<\/a> (rar file, Small_Size_Instances) 3840 instances <\/li><\/ul><\/li><\/ul>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Victor Fernandez-Viagas, Carla Talens, Jose M. Framinan, \u201cAssembly flowshop scheduling problem: Speed-up procedure and computational evaluation&#8221;, European Journal of Operational Research Problem-specific theoretical results (pdf file). Talens C, Perez-Gonzalez P, Fernandez-Viagas V, Framinan JM, \u201cNew hard benchmark for the 2-stage &hellip;<\/p>\n<p class=\"read-more\"> <a class=\"more-link\" href=\"https:\/\/grupo.us.es\/oindustrial\/en\/research\/results\/\"> <span class=\"screen-reader-text\">Results<\/span> Leer m\u00e1s \u00bb<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":393,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"categories":[80],"tags":[],"folder":[],"class_list":["post-807","page","type-page","status-publish","hentry","category-resultados-en"],"_links":{"self":[{"href":"https:\/\/grupo.us.es\/oindustrial\/wp-json\/wp\/v2\/pages\/807","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/grupo.us.es\/oindustrial\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/grupo.us.es\/oindustrial\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/grupo.us.es\/oindustrial\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/grupo.us.es\/oindustrial\/wp-json\/wp\/v2\/comments?post=807"}],"version-history":[{"count":23,"href":"https:\/\/grupo.us.es\/oindustrial\/wp-json\/wp\/v2\/pages\/807\/revisions"}],"predecessor-version":[{"id":1265,"href":"https:\/\/grupo.us.es\/oindustrial\/wp-json\/wp\/v2\/pages\/807\/revisions\/1265"}],"up":[{"embeddable":true,"href":"https:\/\/grupo.us.es\/oindustrial\/wp-json\/wp\/v2\/pages\/393"}],"wp:attachment":[{"href":"https:\/\/grupo.us.es\/oindustrial\/wp-json\/wp\/v2\/media?parent=807"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/grupo.us.es\/oindustrial\/wp-json\/wp\/v2\/categories?post=807"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/grupo.us.es\/oindustrial\/wp-json\/wp\/v2\/tags?post=807"},{"taxonomy":"folder","embeddable":true,"href":"https:\/\/grupo.us.es\/oindustrial\/wp-json\/wp\/v2\/folder?post=807"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}