Browsing by Author "860ee9ac-2632-4ae5-a5fd-78509c2e879b"

Now showing items 1-5 of 5

    • A QPTAS for the general scheduling problem with identical release dates 
      Antoniadis, Antonios; Hoeksma, Rubén; Meißner, Julie; Verschae, José; Wiese, Andreas (Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)
      The General Scheduling Problem (GSP) generalizes scheduling problems with sum of cost objectives such as weighted flow time and weighted tardiness. Given a set of jobs with processing times, release dates, and job dependent ...
    • 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 ...
    • 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 ...
    • Symmetry exploitation for online machine covering with bounded migration 
      Gálvez, Waldo; Soto San Martín, José; Verschae, José (Association for Computing Machinery, USA, 2020)
      Online models that allow recourse can be highly effective in situations where classical online models are too pessimistic. One such problem is the online machine covering problem on identical machines. In this setting, ...
    • Symmetry exploitation for online machine covering with bounded migration 
      Gálvez, Waldo; Soto, José; Verschae, José (Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016)
      Online models that allow recourse are highly effective in situations where classical models are too pessimistic. One such problem is the online machine covering problem on identical machines. In this setting, jobs arrive ...