zbMATH — the first resource for mathematics

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.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
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)
Scheduling deteriorating jobs to minimize makespan. (English) Zbl 0936.90026
Summary: We consider a single-machine problem of scheduling n independent jobs to minimize makespan, in which the processing time of job J j grows by w j with each time unit its start is delayed beyond a given common critical date d. This processing time is p j if J j starts by d. We show that this problem is NP-hard, give a pseudopolynomial algorithm that runs in O(nd j=1 n p i ) time and O(nd) space, and develop a branch-and-bound algorithm that solves instances with up to 100 jobs in a reasonable amount of time. We also introduce the case of bounded deterioration, where the processing time of a job grows no further if the job starts after a common maximum deterioration date D>d. For this case, we give two pseudopolynomial time algorithms: one runs in O(n 2 d(D-d) j=1 n p j ) time and O(nd(D-d)) space, the other runs in O(nd j=1 n w j ( j=1 n p j ) 2 ) time and O(nd j=1 n w j j=1 n p j ) space.
90B35Scheduling theory, deterministic
90C39Dynamic programming
90C57Polyhedral combinatorics, branch-and-bound, branch-and-cut