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)
Single-machine total completion time scheduling with a time-dependent deterioration. (English) Zbl 1211.90092
Summary: We consider the single-machine scheduling problems with a time-dependent deterioration. By the time-dependent deterioration, we mean that the processing time of a job is defined by an increasing function of total normal processing time of jobs in front of it in the sequence. The objective is to minimize the total completion time. We develop a mixed integer programming formulation for the problem. The complexity status of this problem remains open. Hence, we use the smallest normal processing time (SPT) first rule as a heuristic algorithm for the general cases and analyze its worst-case error bound. Two heuristic algorithms utilize the V-shaped property are also proposed to solve the problem. Computational results are presented to evaluate the performance of the proposed algorithms.
90B35Scheduling theory, deterministic
[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]Cheng, T. C. E.; Ding, Q.; Lin, B. M. T.: A concise survey of scheduling with time-dependent processing times, European J. Oper. res. 152, 1-13 (2004) · Zbl 1030.90023 · doi:10.1016/S0377-2217(02)00909-8
[3]Wu, C. -C.; Lee, W. -C.; Y-R, Shiau: Minimizing the total weighted completion time on a single machine under linear deterioration, Int. J. Adv. manuf. Technol. 33, 1237-1243 (2007)
[4]Shiau, Y. -R.; Lee, W. -C.; Wu, C. -C.; Chang, C. -M.: Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration, Int. J. Adv. manuf. Techno. 34, 774-782 (2007)
[5]Wang, J. -B.; Lin, L.; Shan, F.: Single-machine group scheduling problems with deteriorating jobs, Int. J. Adv. manuf. Technol. 39, 808-812 (2008)
[6]Toksar, M. D.; Guner, E.: Minimizing the earliness/tardiness costs on parallel machine with learning effects and deteriorating jobs: a mixed nonlinear integer programming approach, Int. J. Adv. manuf. Technol. 38, 801-808 (2008)
[7]Wang, J. -B.; Cheng, T. C. E.: Scheduling problems with the effects of deterioration and learning, Asia-pac. J. oper. Res. 24, 245-261 (2007) · Zbl 1121.90066 · doi:10.1142/S021759590700122X
[8]Wang, J. -B.; Ng, C. T.; Cheng, T. C. E.: Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint, Comput. oper. Res. 35, 2684-2693 (2008) · Zbl 1180.90143 · doi:10.1016/j.cor.2006.12.026
[9]Wang, J. -B.; Jiang, Y.; Wang, G.: Single-machine scheduling with past-sequence-dependent setup times and effects of deterioration and learning, Int. J. Adv. manuf. Technol. 41, 1221-1226 (2009)
[10]Lee, W. -C.; Wu, C. -C.; Liu, H. -C.: A note on single-machine makespan problem with general deteriorating function, Int. J. Adv. manuf. Technol. 40, 1053-1056 (2009)
[11]Cheng, T. C. E.; Wu, C. -C.; Lee, W. -C.: Some scheduling problems with sum-of-processing -times-based and job-position-based learning effects, Inform. sci. 178, 2476-2487 (2008) · Zbl 1172.90397 · doi:10.1016/j.ins.2008.02.002
[12]Cheng, T. C. E.; Wu, C. -C.; Lee, W. -C.: Some scheduling problems with deteriorating jobs and learning effects, Comput. ind. Eng. 54, 972-982 (2008)
[13]Wu, C. -C.; Lee, W. -C.: Single-machine scheduling problems with a learning effect, Appl. math. Model. 32, 1191-1197 (2008) · Zbl 1172.90415 · doi:10.1016/j.apm.2007.03.001
[14]Wu, C. -C.; Lee, W. -C.: Single-machine group scheduling problems with deteriorating setup times and job processing times, Int. J. Prod. econ. 115, 128-133 (2008)
[15]Toksar, M. D.; Guner, E.: Parallel machine scheduling problem to minimize the earliness/tardiness costs with learning effect and deteriorating jobs, J. intell. Manuf. (2009)
[16]Wang, J. -B.; Gao, W. -J.; Wang, L. -Y.; Wang, D.: Single machine group scheduling with general linear deterioration to minimize the makespan, Int. J. Adv. manuf. Technol. 43, 146-150 (2009)
[17]Wang, J. -B.; Wang, L. -Y.; Wang, D.; Wang, X. -Y.: Single-machine scheduling with a time-dependent deterioration, Int. J. Adv. manuf. Technol. 43, 805-809 (2009)
[18]Ji, M.; Cheng, T. C. E.: Parallel-machine scheduling of simple linear deteriorating jobs, Theoret. comput. Sci. 410, 3761-3768 (2009) · Zbl 1171.68003 · doi:10.1016/j.tcs.2009.04.018
[19]Ng, C. T.; Wang, J. -B.; Cheng, T. C. E.; Liu, L. -L.: A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs, Comput. oper. Res. 37, 83-90 (2010) · Zbl 1171.90404 · doi:10.1016/j.cor.2009.03.019
[20]Yin, Y.; Xu, D.; Wang, J. -B.: Notes on ”single-machine scheduling with a time-dependent deterioration”, Int. J. Adv. manuf. Technol. 50, 809-810 (2010)
[21]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. discrete math. 5, 287-326 (1979) · Zbl 0411.90044
[22]Kanet, J. J.: Minimizing variation of flow time in single machine systems, Manag. sci. 27, 1453-1459 (1981) · Zbl 0473.90048 · doi:10.1287/mnsc.27.12.1453