Oscar C. Vásquez

  • Citations Per Year
Learn More
Typically in a scheduling problem we are given jobs of different processing times pj and different priority weights wj , and need to schedule them on a single machine in order to minimize a specific cost function. In this paper we consider the non-linear objective function ∑ wjC β j , where Cj is the completion time of job j and β > 0 is some arbitrary real(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)
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)
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 studies a single machine problem related to the Just-In-Time (JIT) production objective in which the goal is to minimize the sum of weighted mean squared deviation of the completion times with respect to a common due date. In order to solve the problem, several structural and dominance properties of the optimal solution are investigated. These(More)