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 a maintenance activity and due-window assignment on a single machine. (English) Zbl 1179.90146
Summary: We study a single machine scheduling and due-window assignment problem. In addition to the traditional decisions regarding sequencing the jobs and scheduling the due-window, we allow an option for performing a maintenance activity. This activity requires a fixed time interval during which the machine is turned off and no production is performed. On the other hand, after the maintenance time, the machine becomes more efficient, as reflected in the new shortened job processing times. The objective is to schedule the jobs, the due-window and the maintenance activity, so as to minimize the total cost consisting of earliness, tardiness, and due-window starting time and size. We introduce an efficient (polynomial time) solution for this problem.
90B35Scheduling theory, deterministic
90B25Reliability, availability, maintenance, inspection, etc. (optimization)
[1]Liman, S. D.; Panwalker, S. S.; Thongmee, S.: Common due window size and location determination in a single machine scheduling problem, Journal of the operational research society 49, 1007-1010 (1998) · Zbl 1140.90405
[2]Ji, M.; He, Y.; Cheng, T. C. E.: Single machine scheduling with periodic maintenance to minimize makespan, Computers & operations research 34, 1764-1770 (2007) · Zbl 1159.90404 · doi:10.1016/j.cor.2005.05.034
[3]Yang, D. L.; Hsu, C. J.; Kuo, W. H.: A two machine flowshop scheduling problem with a separated maintenance constraint, Computers & operations research 35, 876-883 (2008)
[4]Lee, C. -L.; Leon, V. -J.: Machine scheduling with a rate modifying activity, European journal of operational research 129, 119-128 (2001) · Zbl 0983.90020 · doi:10.1016/S0377-2217(99)00066-1
[5]Mosheiov, G.; Oron, D.: Due-date assignment and maintenance activity scheduling problem, Mathematical and computer modeling 44, 1053-1057 (2006) · Zbl 1161.90397 · doi:10.1016/j.mcm.2006.03.008
[6]Lee, C. -Y.: Machine scheduling with availability constraints, Handbook of scheduling: algorithms, models and performance analysis (2004)
[7]Lee, C. -Y.; Chen, Z. -L.: Scheduling jobs and maintenance activities on parallel machines, Naval research logistics 47, 145-165 (2000) · Zbl 0973.90034 · doi:10.1002/(SICI)1520-6750(200003)47:2<145::AID-NAV5>3.0.CO;2-3
[8]Kubzin, M. A.; Strusevich, V. A.: Planning machine maintenance in two-machine shop scheduling, Operations research 54, 789-800 (2006) · Zbl 1167.90669 · doi:10.1287/opre.1060.0301