| Publication | Date of Publication | Type |
|---|
Minimizing the maximum lateness for scheduling with release times and job rejection
Journal of Combinatorial Optimization | 2024-12-03 | Paper |
Knapsack problems with position-dependent item weights or profits
Annals of Operations Research | 2023-07-31 | Paper |
A 7/6–Approximation Algorithm For 3-Partitioning And Its Application To Multiprocessor Scheduling
INFOR: Information Systems and Operational Research | 2023-04-21 | Paper |
An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time
Theoretical Computer Science | 2021-07-22 | Paper |
Using weight decision for decreasing the price of anarchy in selfish bin packing games
European Journal of Operational Research | 2019-06-25 | Paper |
Complexity results for common due date scheduling problems with interval data and minmax regret criterion
Discrete Applied Mathematics | 2019-06-20 | Paper |
Restricted assignment scheduling with resource constraints
Theoretical Computer Science | 2019-01-25 | Paper |
| Bin packing games with weight decision: how to get a small value for the price of anarchy | 2019-01-15 | Paper |
Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
Algorithmica | 2018-10-18 | Paper |
Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
European Journal of Operational Research | 2018-07-12 | Paper |
Approximability issues for unconstrained and constrained maximization of half-product related functions
Theoretical Computer Science | 2016-12-23 | Paper |
Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
Journal of Combinatorial Optimization | 2016-10-12 | Paper |
Semi-online scheduling on a single machine with unexpected breakdown
Theoretical Computer Science | 2016-08-31 | Paper |
Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
Annals of Operations Research | 2016-07-22 | Paper |
A 13/12 approximation algorithm for bin packing with extendable bins
Information Processing Letters | 2016-06-09 | Paper |
Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
European Journal of Operational Research | 2016-03-15 | Paper |
An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
Journal of Scheduling | 2016-01-22 | Paper |
Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals
Journal of Combinatorial Optimization | 2015-09-28 | Paper |
Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times
Discrete Applied Mathematics | 2015-09-22 | Paper |
Offline black and white bin packing
Theoretical Computer Science | 2015-07-24 | Paper |
Online results for black and white bin packing
Theory of Computing Systems | 2015-05-12 | Paper |
An efficient algorithm for bin stretching
Operations Research Letters | 2014-05-14 | Paper |
Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance
Journal of Scheduling | 2014-02-05 | Paper |
Black and white bin packing
Approximation and Online Algorithms | 2013-09-13 | Paper |
Multiple subset sum with inclusive assignment set restrictions
Naval Research Logistics | 2013-06-27 | Paper |
Preemptive scheduling on two identical parallel machines with a single transporter
Journal of Combinatorial Optimization | 2013-03-25 | Paper |
The symmetric quadratic knapsack problem: approximation and scheduling applications
4OR | 2013-02-06 | Paper |
Parallel dedicated machines scheduling with chain precedence constraints
European Journal of Operational Research | 2012-12-29 | Paper |
Algorithms better than LPT for semi-online scheduling with decreasing processing times
Operations Research Letters | 2012-11-08 | Paper |
A 3/2-approximation algorithm for \(k_i\)-partitioning
Operations Research Letters | 2012-04-05 | Paper |
Approximating multiobjective knapsack problems
Management Science | 2012-02-19 | Paper |
| Single machine scheduling with a common due date: total weighted tardiness problems | 2012-01-26 | Paper |
Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates
Journal of Scheduling | 2011-10-18 | Paper |
Scheduling parallel dedicated machines with the speeding-up resource
Naval Research Logistics | 2011-04-15 | Paper |
Batch machine production with perishability time windows and limited batch size
European Journal of Operational Research | 2011-03-22 | Paper |
Transporting jobs through a processing center with two parallel machines
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
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 | 2010-06-18 | Paper |
Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
Algorithmica | 2010-05-28 | Paper |
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 | 2009-12-07 | Paper |
Operator non-availability periods
4OR | 2009-12-02 | Paper |
An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
Operations Research Letters | 2008-08-06 | Paper |
Parallel machine scheduling with job assignment restrictions
Naval Research Logistics | 2008-01-09 | Paper |
A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
Theoretical Computer Science | 2007-01-09 | Paper |
Semi-on-line multiprocessor scheduling with given total processing time
Theoretical Computer Science | 2005-06-30 | Paper |
Improved dynamic programming in connection with an FPTAS for the knapsack problem
Journal of Combinatorial Optimization | 2005-03-15 | Paper |
Algorithms for on-line bin-packing problems with cardinality constraints
Discrete Applied Mathematics | 2004-11-23 | Paper |
Lower bounds and semi on-line multiprocessor scheduling
Computer Science Journal of Moldova | 2004-10-28 | Paper |
| scientific article; zbMATH DE number 2107164 (Why is no real title available?) | 2004-10-12 | Paper |
Design of tariff zones in public transportation networks: theoretical results and heuristics
Mathematical Methods of Operations Research | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2081032 (Why is no real title available?) | 2004-08-04 | Paper |
Approximation schemes for ordered vector packing problems
Naval Research Logistics | 2004-03-15 | Paper |
Scheduling problems for parallel dedicated machines under multiple resource constraints.
Discrete Applied Mathematics | 2004-01-05 | Paper |
Optimization of cardinality constrained portfolios with a hybrid local search algorithm
OR Spectrum | 2003-11-09 | Paper |
A 3/4-approximation algorithm for multiple subset sum
Journal of Heuristics | 2003-08-28 | Paper |
An efficient fully polynomial approximation scheme for the Subset-Sum problem.
Journal of Computer and System Sciences | 2003-08-13 | Paper |
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
Operations Research Letters | 2003-05-04 | Paper |
Scheduling parallel dedicated machines under a single non-shared resource
European Journal of Operational Research | 2003-04-28 | Paper |
Bounds and tabu search for a cyclic max-min scheduling problem
Journal of Heuristics | 2002-12-15 | Paper |
| scientific article; zbMATH DE number 1833403 (Why is no real title available?) | 2002-11-21 | Paper |
| scientific article; zbMATH DE number 1830735 (Why is no real title available?) | 2002-11-18 | Paper |
A PTAS for the multiple subset sum problem with different knapsack capacities
Information Processing Letters | 2002-07-25 | Paper |
The stock size problem
Operations Research | 2002-07-01 | Paper |
Selecting portfolios with fixed costs and minimum transaction lots
Annals of Operations Research | 2001-06-14 | Paper |
A 5/4 linear time bin packing algorithm
Journal of Computer and System Sciences | 2001-05-28 | Paper |
The multiple subset sum problem
SIAM Journal on Optimization | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1418034 (Why is no real title available?) | 2001-02-09 | Paper |
| scientific article; zbMATH DE number 1559404 (Why is no real title available?) | 2001-01-31 | Paper |
Approximation algorithms for knapsack problems with cardinality constraints
European Journal of Operational Research | 2000-07-09 | Paper |
| scientific article; zbMATH DE number 1418266 (Why is no real title available?) | 2000-03-19 | Paper |
Two linear approximation algorithms for the subset-sum problem
European Journal of Operational Research | 2000-03-19 | Paper |
Cardinality constrained bin-packing problems
Annals of Operations Research | 2000-01-11 | Paper |
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1263266 (Why is no real title available?) | 1999-10-28 | Paper |
A new fully polynomial time approximation scheme for the Knapsack problem
Journal of Combinatorial Optimization | 1999-09-22 | Paper |
The \(k\)-partitioning problem
Mathematical Methods of Operations Research | 1999-08-22 | Paper |
| scientific article; zbMATH DE number 1256760 (Why is no real title available?) | 1999-07-05 | Paper |
| scientific article; zbMATH DE number 1281677 (Why is no real title available?) | 1999-04-29 | Paper |
A linear compound algorithm for uniform machine scheduling
Computing | 1999-03-16 | Paper |
Semi on-line algorithms for the partition problem
Operations Research Letters | 1998-12-03 | Paper |
| scientific article; zbMATH DE number 1182767 (Why is no real title available?) | 1998-08-02 | Paper |
| scientific article; zbMATH DE number 1104339 (Why is no real title available?) | 1998-01-14 | Paper |
| Note: Open-shop scheduling with release dates to minimize maximum lateness | 1995-05-14 | Paper |
| scientific article; zbMATH DE number 566079 (Why is no real title available?) | 1995-01-22 | Paper |
On the Euclidean two paths problem
Discrete Applied Mathematics | 1994-03-17 | Paper |
A tight bound for 3-partitioning
Discrete Applied Mathematics | 1994-01-04 | Paper |
A greedy heuristic for 3-partitioning with similar elements
Computing | 1993-10-18 | Paper |
A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling
Acta Mathematicae Applicatae Sinica. English Series | 1993-05-25 | Paper |
The exact LPT-bound for maximizing the minimum completion time
Operations Research Letters | 1992-12-17 | Paper |
UET-scheduling with constrained processor allocations
Computers & Operations Research | 1992-06-28 | Paper |
Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm
Computing | 1991-01-01 | Paper |
Prime covers and periodic patterns
Discrete Mathematics | 1990-01-01 | Paper |
Über die Quadratwurzel-Schranke für quadratische-Rest-Codes. (On the square root bound for quadratic-residue codes)
Journal of Geometry | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4033669 (Why is no real title available?) | 1987-01-01 | Paper |
