Results

  • Victor Fernandez-Viagas, Carla Talens, Jose M. Framinan, “Assembly flowshop scheduling problem: Speed-up procedure and computational evaluation”, European Journal of Operational Research
    • Problem-specific theoretical results (pdf file).
  • Talens C, Perez-Gonzalez P, Fernandez-Viagas V, Framinan JM, “New hard benchmark for the 2-stage multi-machine assembly scheduling problem: Design and computational evaluation”, Computers and Industrial Engineering
    • Detailed statistical results (zip file).
    • Benchmark B1 (zip file).
    • Benchmark B2 (zip file).
    • Upper bounds (zip file).
  • Perez-Gonzalez P, Fernandez-Viagas V, Framinan JM, Permutation flowshop scheduling with periodic maintenance and makespan objective, Report (2019) 
    • Instances
      • Big-size instances: Taillard TestBed  
      • Small-size instances (zip file, MILP instances) 180 instances
      • Small-size instances (zip file, Complete enumeration instances) 600 instances
    • Results
      • MILP (xlsx)
      • Complete Enumeration (zip file)
      • Heuristics (xlsx Small instances)
      • Heuristics (xlsx Big instances T constant)
      • Heuristics (xlsx Big instances T variable)
  • Talens C, Fernandez-Viagas V, Perez-Gonzalez P, Framinan JM, “New efficient constructive heuristics for the two-stage multi-machine assembly scheduling problem”, Computers & Industrial Engineering
  • Fernandez-Viagas V, Framinan JM, “Design of a testbed for hybrid flow shop scheduling with identical machines”, Computers and Industrial Engineering.
  • Framiñán JM, Perez-Gonzalez P, “New approximate algorithms for the customer order scheduling problem with total completion time objective“, Computers & Operations Research (2017), 78, pp. 181-192.
    • Testbed instance 1 (small instances, zip file testbed_1_s.zip)
    • Testbed instance 1 (big instances, zip  file testbed_1_b.zip)
    • Testbed instance 2 (small instances, zip  file testbed_2_s.zip)
    • Testbed instance 2 (big instances, zip  file testbed_2_b.zip)
    • 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 ….
    • Excel file with the best-so-far solutions for the big instances
    • Excel file with the best-so-far solutions for the small instances
  • Framinan JM, Perez-Gonzalez P, Order Scheduling with Tardiness Objective: Improved Approximate Solutions, 2018, European Journal of Operational Research, 266 (3), 840-850.
    • Testbed SMALL (2,700 instances) (small instances, zip file cos_tardiness_SMALL.zip)
    • Testbed BIG (1,440 instances) (big instances, zip file cos_tardiness_BIG.zip)
    • 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 ….
    • Excel file with the best-so-far solutions for the testbed SMALL
    • Excel file with the best-so-far solutions for the testbed BIG
  • Perez-Gonzalez P, Fernandez-Viagas V, Zamora García M, Framinan JM, Constructive heuristics for the unrelated parallel machines scheduling problem with machine eligibility and setup times, Computers & Industrial Engineering
    (2019) 131, pp. 131-145