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 to minimize total convex resource consumption with a constraint on total weighted flow time. (English) Zbl 1251.90197
Summary: In this paper, we consider single-machine scheduling problem in which processing time of a job is described by a convex decreasing resource consumption function. The objective is to minimize the total amount of resource consumed subject to a constraint on total weighted flow time. The optimal resource allocation is obtained for any arbitrary job sequence. The computational complexity of the general problem remains an open question, but we present and analyze some special cases that are solvable by using polynomial time algorithms. For the general problem, several dominance properties and some lower bounds are derived, which are used to speed up the elimination process of a branch-and-bound algorithm proposed to solve the problem. A heuristic algorithm is also proposed, which is shown by computational experiments to perform effectively and efficiently in obtaining near-optimal solutions. The results show that the average percentage error of the proposed heuristic algorithm from optimal solutions is less than 3%.
MSC:
90B35Scheduling theory, deterministic
References:
[1]Elmaghraby, S. E.: Activity network, (1977)
[2]Kaspi, M.; Shabtay, D.: Convex resource allocation for minimizing the makespan in a single machine with job release dates, Computers and operations research 31, 1481-1489 (2004) · Zbl 1076.68018 · doi:10.1016/S0305-0548(03)00103-5
[3]Leyvand, Y.; Shabtay, D.; Steiner, G.; Yedidsion, L.: Just-in-time scheduling with controllable processing times on parallel machines, Journal of combinatorial optimization 19, 347-368 (2010) · Zbl 1188.90100 · doi:10.1007/s10878-009-9270-5
[4]Monma, C. L.; Schrijver, A.; Todd, M. J.; Wei, V. K.: Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases and extensions, Mathematics of operations research 15, 736-748 (1990) · Zbl 0717.90080 · doi:10.1287/moor.15.4.736
[5]Nowicki, E.; Zdrzalka, S.: A survey of results for sequencing problems with controllable processing times, Discrete applied mathematics 26, 271-287 (1990) · Zbl 0693.90056 · doi:10.1016/0166-218X(90)90105-L
[6]Shabtay, D.; Itskovich, Y.; Yedidsion, L.; Oron, D.: Optimal due date assignment and resource allocation in a group technology scheduling environment, Computers and operations research 37, 2218-2228 (2010) · Zbl 1231.90214 · doi:10.1016/j.cor.2010.03.012
[7]Shabtay, D.; Kaspi, M.: Minimizing the total weighted flow time in a single machine with controllable processing times, Computers and operations research 31, 2279-2289 (2004) · Zbl 1073.90017 · doi:10.1016/S0305-0548(03)00187-4
[8]Shabtay, D.; Kaspi, M.: Parallel machine scheduling with a convex resource consumption function, European journal of operational research 173, 92-107 (2006) · Zbl 1125.90023 · doi:10.1016/j.ejor.2004.12.008
[9]Shabtay, D.; Steiner, G.: A survey of scheduling with controllable processing times, Discrete applied mathematics 155, 1643-1666 (2007) · Zbl 1119.90022 · doi:10.1016/j.dam.2007.02.003