Yasmin Rios-Solis

Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations

  • M.-C. Plateau
  • Yasmin Rios-Solis
    • Categories Applications - OR and Management Sciences, Quadratic Programming, Scheduling Tags , ,

    In this work, we take advantage of the powerful quadratic programming theory to obtain optimal solutions of scheduling problems. We apply a methodology that starts, in contrast to more classical approaches, by formulating three unrelated parallel machine scheduling problems as 0–1 quadratic programs under linear constraints. By construction, these quadratic programs are non-convex. Therefore, before … Read more

    Exponential neighborhood search for a parallel machine scheduling problem

  • Yasmin Rios-Solis
  • Francis Sourd
    • Categories Applications - OR and Management Sciences, Scheduling

    We consider the parallel machine scheduling problem where jobs have different earliness-tardiness penalties and a restrictive common due date. This problem is NP-hard in the strong sense. In this paper we define an exponential size neighborhood for this problem and prove that finding the local minimum in it is an NP-hard problem. The main contribution … Read more

    Lower bounds for the earliness-tardiness scheduling problem on single and parallel machines

  • Safia Kedad-Sidhoum
  • Yasmin Rios-Solis
  • Francis Sourd
    • Categories Scheduling Tags , , , ,

    This paper addresses the parallel machine scheduling problem in which the jobs have distinct due dates with earliness and tardiness costs. New lower bounds are proposed for the problem, they can be classed into two families. First, two assignment-based lower bounds for the one-machine problem are generalized for the parallel machine case. Second, a time-indexed … Read more