Jackson's pseudo-preemptive schedule and cumulative scheduling problems
نویسندگان
چکیده
منابع مشابه
Jackson's pseudo-preemptive schedule and cumulative scheduling problems
The aim of this paper is to show the usefulness of the Jackson’s pseudo-preemptive schedule (JPPS) for solving cumulative scheduling problems. JPPS was introduced for the m-processor scheduling problem Pm=ri; qi=Cmax. In the latter problem, a set I of n operations has to be scheduled without preemption on m identical processors in order to minimize the makespan. Each operation i has a release d...
متن کاملAn Optimization via Simulation approach for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problems
In this paper a novel modelling and solving method has been developed to address the so-called resource constrained project scheduling problem (RCPSP) where project tasks have multiple modes and also the preemption of activities are allowed. To solve this NP-hard problem, a new general optimization via simulation (OvS) approach has been developed which is the main contribution of the current re...
متن کاملAdjustments of Release and Due Dates for Cumulative Scheduling Problems
This paper presents a set of satisfiability tests and time-bound adjustments that can be applied to cumulative scheduling problems. We introduce the Cumulative Scheduling Problem (CuSP), an extension of the m-machine problem in which activities, having both release and due dates, can require more than one unit of the resource. Given a CuSP instance, we present two necessary conditions for the e...
متن کاملSatisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems
This paper presents a set of satisfiability tests and time-bound adjustment algorithms that can be applied to cumulative scheduling problems. An instance of the Cumulative Scheduling Problem (CuSP) consists of (1) one resource with a given capacity and (2) a set of activities, each having a release date, a deadline, a processing time and a resource capacity requirement for each activity. The pr...
متن کاملApproximating Preemptive Stochastic Scheduling
We present constant approximative policies for preemptive stochastic scheduling. We derive policies with a guaranteed performance ratio of 2 for scheduling jobs with release dates on identical parallel machines subject to minimizing the sum of weighted completion times. Our policies as well as their analysis apply also to the recently introduced more general model of stochastic online schedulin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/j.dam.2003.09.009