# 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)
Minimizing the total weighted completion time of deteriorating jobs. (English) Zbl 1032.68019
Summary: The paper deals with a single machine problem of scheduling jobs with start time dependent processing times to minimize the total weighted completion time. The computational complexity of this problem was unknown for ten years. We prove that the problem is NP-hard.

##### MSC:
 68M20 Performance evaluation of computer systems; queueing; scheduling
Full Text:
##### References:
 [1] Alidaee, B.; Womer, N. K.: Scheduling with time dependent processing times: review and extensions. J. oper. Res. soc. 50, 711-720 (1999) · Zbl 1054.90542 [2] Bachman, A.; Ng, C. T.; Cheng, T. C. E.; Janiak, A.: Scheduling deteriorating jobs to minimize the total weighted completion time, working paper. (2000) · Zbl 1059.90063 [3] Browne, S.; Yechiali, U.: Scheduling deteriorating jobs on a single processor. Oper. res. 38, No. 3, 495-498 (1990) · Zbl 0703.90051 [4] Garey, M. R.; Johnson, D. S.: Computers and intractability: A guide to the theory of NP-completeness. (1979) · Zbl 0411.68039 [5] Graham, R. L.; Lawler, E. L.; Lenstra, J. K.; Kan, A. H. G. Rinnooy: Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. of discrete math. 5, 287-326 (1979) · Zbl 0411.90044 [6] Mosheiov, G.: V-shaped policies for scheduling deteriorating jobs. Oper. res. 39, No. 6, 979-991 (1991) · Zbl 0748.90033 [7] Mosheiov, G.: Scheduling jobs under simple linear deterioration. Comput. oper. Res. 21, No. 6, 653-659 (1994) · Zbl 0810.90074 [8] Mosheiov, G.: {$\Lambda$}-shaped policies to schedule deteriorating jobs. J. oper. Res. soc. 47, 1184-1191 (1996) · Zbl 0869.90039 [9] Smith, W. E.: Various optimizers for single-stage production. Naval res. Logistics quarterly 3, 59-66 (1956)