Browsing by Author "bbd159d0-ea2f-4073-8c8d-d876b7cb3863"

Now showing items 1-3 of 3

    • Breaking symmetries to rescue sum of squares in the case of makespan scheduling 
      Verdugo, Víctor; Verschae, José; Wiese, Andreas (Springer, 2020)
      The sum of squares (SoS) hierarchy gives an automatized technique to create a family of increasingly tight convex relaxations for binary programs. There are several problems for which a constant number of rounds of this ...
    • On the extension complexity of scheduling 
      Tiwary, Hans Raj; Verdugo, Víctor; Wiese, Andreas (Elsevier, 2020)
      We study the minimum makespan problem on identical machines in which we want to assign a set of n given jobs to m machines in order to minimize the maximum load over the machines. We prove upper and lower bounds for the ...
    • Splitting versus setup trade-offs for scheduling to minimize weighted completion time 
      Correa Haeussler, José; Verdugo, Víctor; Verschae, José (Elsevier, 2016)
      We study scheduling problems when jobs can be split and a setup is required before processing each part, to minimize the weighted sum of completion times. Using a simple splitting strategy and a reduction to an orders ...