Oscar C. Vásquez

Learn More
We consider a strategic game, where players submit jobs to a machine that executes all jobs in a way that minimizes energy while respecting the jobs' deadlines. The energy consumption is then charged to the players in some way. Each player wants to minimize the sum of that charge and of their job's deadline multiplied by a priority weight. Two charging(More)
We consider the classical scheduling problem on a single machine, on which we need to schedule sequentially n given jobs. Every job j has a processing time p j and a priority weight w j , and for a given schedule a completion time C j. In this paper we consider the problem of minimizing the objective value j w j C β j for some fixed constant β > 0. This(More)
Since a few years there is an increasing interest in minimizing the energy consumption of computing systems. However in a shared computing system, users want to optimize their experienced quality of service, at the price of a high energy consumption. In this work, we address the problem of optimizing and designing mechanisms for a linear combination of(More)
This paper introduces a novel scheduling problem, where jobs occupy a triangular shape on the time line. This problem is motivated by scheduling jobs with different criticality levels. A measure is introduced, namely the binary tree ratio. It is shown that the greedy algorithm solves the problem to optimality when the binary tree ratio is at most 2. We also(More)
OBJECTIVE To create a computerized model and simulation of the patient visit/ referrals process for a health care services organization within Chile's public health care system. METHODS The study was performed with a 'system dynamics' focus. Data were collected from the health care service centers, and a referrals model was created. Specialty areas to be(More)