# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
Jackson’s pseudo-preemptive schedule and cumulative scheduling problems. (English) Zbl 1058.90023
Summary: 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/r_i, q_i/C_{\max}$. 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 date (or head) $r_i$, a processing time $p_i$, and a tail $q_i$. In the cumulative scheduling problem (CuSP), an operation $i$ requires a constant amount $e_i$ of processors throughout its processing. A CuSP is obtained, for instance, from the resource constrained project scheduling problem (RCPSP) by choosing a resource and relaxing the constraints induced by the other resources. We state new properties on JPPS and we show that it can be used for studying the CuSP and for performing adjustments of heads and tails using a strategy very close to the one designed by Carlier and Pinson for the $1/r_i$, $q_i/C_{\max}$ sequencing problem. It confirms the interest of JPPS for solving RCPSP.

##### MSC:
 90B35 Scheduling theory, deterministic