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)
Single-machine scheduling with a nonlinear deterioration function. (English) Zbl 1229.90062
Summary: In deteriorating job scheduling problems, most of the researchers assume that the actual job processing time is a function of its starting time. In this paper, we propose a new deterioration model in which the actual job processing time is a general function of the normal processing time of jobs already processed and its scheduled position at the same time. We show that some single-machine scheduling problems remain polynomially solvable.
MSC:
90B35Scheduling theory, deterministic
68Q25Analysis of algorithms and problem complexity
References:
[1]Williams, T. J. E.: Analysis and design of hierarchical control systems: with special reference to steel plant operations, (1986)
[2]Gupta, J. N. D.; Gupta, S. K.: Single facility scheduling with nonlinear processing times, Computers & industrial engineering 14, 387-393 (1988)
[3]Kunnathur, A. S.; Gupta, S. K.: Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem, European journal of operational research 47, No. 1, 56-64 (1990) · Zbl 0717.90034 · doi:10.1016/0377-2217(90)90089-T
[4]Browne, S.; Yechiali, U.: Scheduling deteriorating jobs on a single processor, Operations research 38, 495-498 (1990) · Zbl 0703.90051 · doi:10.1287/opre.38.3.495
[5]Rachaniotis, N. P.; Pappis, C. P.: Scheduling fire fighting tasks using the concept of deteriorating jobs, Canadian journal of forest research 36, 652-658 (2006)
[6]Alidaee, B.; Womer, N. K.: Scheduling with time dependent processing times: review and extensions, Journal of the operational research society 50, 711-720 (1999) · Zbl 1054.90542
[7]Cheng, T. C. E.; Ding, Q.; Lin, B. M. T.: A concise survey of scheduling with time-dependent processing times, European journal of operational research 152, 1-13 (2004) · Zbl 1030.90023 · doi:10.1016/S0377-2217(02)00909-8
[8]Wang, J. B.; Xia, Z. Q.: Flowshop scheduling with deteriorating jobs under dominating machines, omega, The international journal of management science 34, 327-336 (2006)
[9]Ji, M.; He, Y.; Cheng, T. C. E.: Scheduling linear deteriorating jobs with an availability constraint on a single machine, Theoretical computer science 362, 115-126 (2006) · Zbl 1100.68009 · doi:10.1016/j.tcs.2006.06.006
[10]Ji, M.; Cheng, T. C. E.: An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan, Information processing letters 102, 41-47 (2007) · Zbl 1184.68125 · doi:10.1016/j.ipl.2006.11.014
[11]Gawiejnowicz, S.: Scheduling deteriorating jobs subject to job or machine availability constraints, European journal of operational research 180, 472-478 (2007) · Zbl 1114.90034 · doi:10.1016/j.ejor.2006.04.021
[12]Wang, J. B.; Ng, C. T.; Cheng, T. C. E.: Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint, Computers & operations research 35, 2684-2693 (2008) · Zbl 1180.90143 · doi:10.1016/j.cor.2006.12.026
[13]Lee, W. C.; Wu, C. C.; Wen, C. C.; Chung, Y. H.: A two-machine flowshop makespan scheduling problem with deteriorating jobs, Computers & industrial engineering 54, 737-749 (2008)
[14]Ji, M.; Cheng, T. C. E.: An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan, Information processing letters 108, 171-174 (2008) · Zbl 1191.68102 · doi:10.1016/j.ipl.2008.04.021
[15]Wu, C. C.; Lee, W. C.: Single-machine group scheduling problems with deteriorating setup times and job processing times, International journal of production economics 115, 128-133 (2008)
[16]Wu, C. C.; Shiau, Y. R.; Lee, W. C.: Single-machine group scheduling problems with deterioration consideration, Computers & operations research 35, 1652-1659 (2008) · Zbl 1211.90094 · doi:10.1016/j.cor.2006.09.008
[17]Cheng, T. C. E.; Wu, C. C.; Lee, W. C.: Some scheduling problems with deteriorating jobs and learning effects, Computers & industrial engineering 54, 972-982 (2008)
[18]Lee, W. C.; Chung, Y. H.; Wu, C. C.: Scheduling deteriorating jobs on a single machine with release times, Computers & industrial engineering 54, 441-452 (2008)
[19]Chung, Y. H.; Liu, H. C.; Wu, C. C.; Lee, W. C.: A deteriorating jobs problem with quadratic function of job lateness, Computers & industrial engineering 57, 1182-1186 (2009)
[20]Gawiejnowicz, S.: Time-dependent scheduling, monographs in theoretical computer science, An EATCS series (2008)
[21]Sundararaghavan, P. S.; Kunnathur, A. S.: Single machine scheduling with start time dependent processing time: some solvable cases, European journal of operational research 78, No. 3, 394-403 (1994) · Zbl 0816.90088 · doi:10.1016/0377-2217(94)90048-5
[22]Cheng, T. C. E.; Ding, Q.: Single machine scheduling with step-deteriorating processing times, European journal of operational research 134, 623-630 (2001) · Zbl 0984.90014 · doi:10.1016/S0377-2217(00)00284-8
[23]Voutsinas, T. G.; Pappis, C. P.: Scheduling jobs with values exponentially deteriorating over time, International journal of production economics 79, 163-169 (2002)
[24]Cheng, T. C. E.; Ding, Q.; Kovalyov, M. Y.; Bachman, A.; Janiak, A.: Scheduling jobs with piecewise linear decreasing processing times, Naval research logistics 50, No. 6, 531-554 (2003) · Zbl 1043.90027 · doi:10.1002/nav.10073
[25]Biskup, D.: A state-of-the-art review on scheduling with learning effect, European journal of operational research 188, 315-329 (2008) · Zbl 1129.90022 · doi:10.1016/j.ejor.2007.05.040