Items where Author is "Kellerer, Hans"

Group by: Item Type | Uncontrolled Keywords | No Grouping

Number of items: 53.

approximation

Strusevich, Vitaly A. and Kellerer, Hans (2013) Approximation schemes for quadratic Boolean programming problems and their scheduling applications. In: OR55 Annual Conference - Keynote Papers and Extended Abstracts. Operational Research Society Limited, Birmingham, UK, pp. 73-85. ISBN 0903440555

Kellerer, Hans and Strusevich, Vitaly A. (2008) Scheduling parallel dedicated machines with the speeding-up resource. Naval Research Logistics (NRL), 55 (5). pp. 377-389. ISSN 0894-069X (Print), 1520-6750 (Online) (doi:10.1002/nav.20292)

approximation algorithm

Kellerer, Hans, Kubzin, Mikhail A. and Strusevich, Vitaly A. (2009) Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval. European Journal of Operational Research, 199 (1). pp. 111-116. ISSN 0377-2217 (doi:10.1016/j.ejor.2008.11.003)

approximation scheme

Kellerer, Hans, Rustogi, Kabir and Strusevich, Vitaly A. (2012) Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance. Journal of Scheduling, 16 (6). pp. 675-683. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1007/s10951-012-0287-8)

Kellerer, Hans, Soper, Alan J. ORCID: https://orcid.org/0000-0002-0901-9803 and Strusevich, Vitaly A. (2012) Preemptive scheduling on two identical parallel machines with a single transporter. Journal of Combinatorial Optimization, 25 (2). pp. 279-307. ISSN 1382-6905 (Print), 1573-2886 (Online) (doi:10.1007/s10878-012-9511-x)

availability constraints

Kellerer, Hans and Strusevich, Vitaly A. (2008) Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica, 57 (4). pp. 769-795. ISSN 0178-4617 (Print), 1432-0541 (Online) (doi:10.1007/s00453-008-9248-1)

Combinatorial optimization

Halman, Nir, Kellerer, Hans and Strusevich, Vitaly A. (2018) Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints. European Journal of Operational Research, 270 (2). pp. 435-447. ISSN 0377-2217 (doi:10.1016/j.ejor.2018.04.013)

complexity

deterioration

Earliness-Tardiness

Kellerer, Hans, Rustogi, Kabir and Strusevich, Vitaly A. (2018) A fast FPTAS for single machine scheduling problem of minimizing total weighted earliness and tardiness about a large common due date. Omega, 90:101992. ISSN 0305-0483 (doi:10.1016/j.omega.2018.11.001)

Kellerer, Hans and Strusevich, Vitaly A. (2010) Minimizing total weighted earliness-tardiness on a single machine around a small common due date: an FPTAS using quadratic knapsack. International Journal of Foundations of Computer Science (IJFCS), 21 (3). pp. 357-383. ISSN 0129-0541 (Print), 1793-6373 (Online) (doi:10.1142/S0129054110007301)

FPTAS

Kellerer, Hans and Strusevich, Vitaly (2013) Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product. European Journal of Operational Research, 228 (1). pp. 24-32. ISSN 0377-2217 (doi:10.1016/j.ejor.2012.12.028)

Kellerer, Hans and Strusevich, Vitaly A. (2011) The symmetric quadratic knapsack problem: approximation and scheduling applications. 4OR: A Quarterly Journal of Operations Research, 10 (2). pp. 111-161. ISSN 1619-4500 (Print), 1614-2411 (Online) (doi:10.1007/s10288-011-0180-x)

Kellerer, Hans, Soper, Alan J. ORCID: https://orcid.org/0000-0002-0901-9803 and Strusevich, Vitaly A. (2010) Transporting jobs through a processing center with two parallel machines. In: Wu, Weili and Daescu, Ovidiu, (eds.) Combinatorial Optimization and Applications: 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I. Lecture Notes in Computer Science (6508). Springer Berlin Heidelberg, Berlin, Germany, pp. 408-422. ISBN 978364274575 ISSN 0302-9743 (doi:10.1007/978-3-642-17458-2_33)

Items where Author is "Kellerer, Hans"

approximation

approximation algorithm

approximation scheme

availability constraints

Combinatorial optimization

complexity

deterioration

Earliness-Tardiness

FPTAS

Geometric rounding

Half-Product

Half-product problem

K -approximation sets and functions

machine non-availability

maintenance

Non-linear boolean programming

parallel dedicated machines

parallel machines

quadratic boolean programming

quadratic knapsack

resource constraints

scheduling

scheduling agents

scheduling with controllable processing times

scheduling with rejection

scheduling with transportation

single machine

Single machine scheduling

singlemachine scheduling

subset-sum problem

total weighted completion time