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 scheduling with general job-dependent aging effect and maintenance activities to minimize makespan. (English) Zbl 1185.90106
Summary: This paper considers single machine scheduling with an aging effect in which the processing time of a job depends on its position in a sequence. It is assumed that aging ratios are job-dependent and machine can be maintained some times in a schedule. After a maintenance activity, machine will be restored to its initial condition. The processing of jobs and the maintenance activities of machine are scheduled simultaneously. The objective is to schedule the jobs and the maintenance activities, so as to minimize the makespan. We provide a polynomial time algorithm to solve the problem.
90B35Scheduling theory, deterministic
90B25Reliability, availability, maintenance, inspection, etc. (optimization)
[1]Bachman, A.; Janiak, A.: Scheduling jobs with position-dependent processing times, J. oper. Res. soc. 55, 257-264 (2004) · Zbl 1095.90033 · doi:10.1057/palgrave.jors.2601689
[2]Biskup, D.: Single-machine scheduling with learning considerations, Eur. J. Oper. res. 115, 173-178 (1999) · Zbl 0946.90025 · doi:10.1016/S0377-2217(98)00246-X
[3]Mosheiov, G.: Scheduling problems with a learning effect, Eur. J. Oper. res. 132, 687-693 (2001) · Zbl 1017.90051 · doi:10.1016/S0377-2217(00)00175-2
[4]Mosheiov, G.: Parallel machine scheduling with a learning effect, J. oper. Res. soc. 52, 1165-1169 (2001) · Zbl 1178.90159 · doi:10.1057/palgrave.jors.2601215
[5]Mosheiov, G.; Sidney, B.: Scheduling with general job-dependent learning curves, Eur. J. Oper. res. 147, 665-670 (2003) · Zbl 1037.90529 · doi:10.1016/S0377-2217(02)00358-2
[6]Mosheiov, G.: A note on scheduling deteriorating jobs, Math. comput. Modell. 41, 883-886 (2005) · Zbl 1082.90038 · doi:10.1016/j.mcm.2004.09.004
[7]Biskup, D.: A state-of-the-art review on scheduling with learning effects, Eur. J. Oper. res. 188, 315-329 (2008) · Zbl 1129.90022 · doi:10.1016/j.ejor.2007.05.040
[8]Gordon, V. S.; Potts, C. N.; Strusevich, V. A.; Whitehead, J. D.: Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation, J. schedul. 11, 357-370 (2008) · Zbl 1168.90441 · doi:10.1007/s10951-008-0064-x
[9]Gordon, V. S.; Strusevich, V. A.: Single machine scheduling and due date assignment with positionally dependent processing times, Eur. J. Oper. res. 198, 57-62 (2009) · Zbl 1163.90781 · doi:10.1016/j.ejor.2008.07.044
[10]Zhao, Chuan-Li; Tang, Heng-Yong: Single-machine scheduling problems with an aging effect, J. appl. Math. comput. 1 – 2, 305-314 (2007) · Zbl 1178.90167 · doi:10.1007/BF02832355
[11]Graves, G. H.; Lee, C. -Y.: Scheduling maintenance and semiresumable jobs on a single machine, Naval res. Logist. 46, 845-863 (1999) · Zbl 0931.90015 · doi:10.1002/(SICI)1520-6750(199910)46:7<845::AID-NAV6>3.0.CO;2-#
[12]Lee, C. -Y.; Chen, Z. -L.: Scheduling jobs and maintenance activities on parallel machine, Naval res. Logist. 47, 145-165 (2000) · Zbl 0973.90034 · doi:10.1002/(SICI)1520-6750(200003)47:2<145::AID-NAV5>3.0.CO;2-3
[13]Qi, X.; Chen, T.; Tu, F.: Scheduling the maintenance on a single machines, J. oper. Res. soc. 50, 1071-1078 (1999) · Zbl 1054.90550
[14]Lee, C. -Y.; Leon, V. J.: Machine scheduling with a rate-modifying activity, Eur. J. Oper. res. 128, 119-128 (2001) · Zbl 0983.90020 · doi:10.1016/S0377-2217(99)00066-1
[15]Zhao, Chuan-Li; Tang, Heng-Yong; Cheng, Cong-Dian: Two-parallel machines scheduling with rate-modifying activities to minimize total completion time, Eur. J. Oper. res. 198, 354-357 (2009) · Zbl 1163.90518 · doi:10.1016/j.ejor.2008.08.012
[16]Kuo, W. -H.; Yang, D. -L.: Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect, J. oper. Res. soc. 59, 416-420 (2007) · Zbl 1145.90387 · doi:10.1057/palgrave.jors.2602363