| Publication | Date of Publication | Type |
|---|
A dynamic programming algorithm for order picking in robotic mobile fulfillment systems
Networks | 2025-01-08 | Paper |
Planning container inspection and repair: a case study
Computers & Operations Research | 2024-06-06 | Paper |
A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty
Discrete Applied Mathematics | 2024-04-02 | Paper |
Min‐sum controllable risk problems with concave risk functions of the same value range
Networks | 2023-12-11 | Paper |
Fixed interval scheduling with third‐party machines
Networks | 2023-12-11 | Paper |
Integer knapsack problems with profit functions of the same value range
4OR | 2023-10-24 | Paper |
Maximizing total early work in a distributed two‐machine flow‐shop
Naval Research Logistics | 2023-10-24 | Paper |
Single machine scheduling with assignable due dates to minimize maximum and total late work
European Journal of Operational Research | 2023-07-10 | Paper |
Cost minimizing planning of container inspection and repair in multiple facilities
OR Spectrum | 2023-06-26 | Paper |
Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint
4OR | 2023-06-07 | Paper |
A Computational Analysis Of Balanced Jit Optimization Algorithms
INFOR: Information Systems and Operational Research | 2023-04-24 | Paper |
Selecting a subset of diverse points based on the squared Euclidean distance
Annals of Mathematics and Artificial Intelligence | 2022-08-11 | Paper |
Fleet and charging infrastructure decisions for fast-charging city electric bus service
Computers & Operations Research | 2022-03-09 | Paper |
No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines
Computers & Operations Research | 2022-03-07 | Paper |
Min-max controllable risk problems
4OR | 2021-07-14 | Paper |
Provision-after-wait with preferences ordered by difference: tighter complexity and better approximation
European Journal of Operational Research | 2021-06-03 | Paper |
| Maximum diversity problem with squared Euclidean distance | 2020-05-19 | Paper |
Lot-size scheduling of a single product on unrelated parallel machines
Optimization Letters | 2020-04-27 | Paper |
Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity
Journal of Scheduling | 2020-01-22 | Paper |
Bi-criteria path problem with minimum length and maximum survival probability
OR Spectrum | 2020-01-15 | Paper |
Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\)
Theoretical Computer Science | 2019-10-07 | Paper |
Comments on ``Proportionate flowshops with general position dependent processing times and ``Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
Information Processing Letters | 2019-05-10 | Paper |
Multiproduct batching and scheduling with buffered rework: the case of a car paint shop
Naval Research Logistics | 2019-05-02 | Paper |
A parallel machine schedule updating game with compensations and clients averse to uncertain loss
Computers & Operations Research | 2018-12-17 | Paper |
Minimizing the number of workers in a paced mixed-model assembly line
European Journal of Operational Research | 2018-10-30 | Paper |
An overview of revenue management and dynamic pricing models in hotel business
RAIRO - Operations Research | 2018-08-10 | Paper |
Simple paths with exact and forbidden lengths
Naval Research Logistics | 2018-06-06 | Paper |
A note on scheduling container storage operations of two non-passing stacking cranes
Networks | 2018-04-27 | Paper |
Optimal workforce assignment to operations of a paced assembly line
European Journal of Operational Research | 2018-02-01 | Paper |
Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity
RAIRO - Operations Research | 2018-01-12 | Paper |
Knapsack problem with objective value gaps
Optimization Letters | 2017-06-29 | Paper |
Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem
Theoretical Computer Science | 2017-06-13 | Paper |
Graphs with maximal induced matchings of the same size
Discrete Applied Mathematics | 2016-11-24 | Paper |
Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom
Computers & Operations Research | 2016-11-17 | Paper |
Two faster algorithms for coordination of production and batch delivery: a note
European Journal of Operational Research | 2016-07-06 | Paper |
Batch scheduling with deadlines on parallel machines: an NP-hard case
Information Processing Letters | 2016-05-26 | Paper |
Two-agent scheduling with agent specific batches on an unbounded serial batching machine
Journal of Scheduling | 2015-11-12 | Paper |
On a single machine-scheduling problem with separated position and resource effects
Optimization | 2015-04-28 | Paper |
Erratum to: ``Internet shopping with price-sensitive discounts
4OR | 2015-02-23 | Paper |
Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence
Annals of Operations Research | 2015-01-22 | Paper |
Internet shopping with price sensitive discounts
4OR | 2014-09-26 | Paper |
Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs
Information Sciences | 2014-08-01 | Paper |
| Mathematical Caricature of Large Waves | 2014-03-21 | Paper |
| Minimizing total completion time on a batching machine with job processing time compatibilities | 2013-11-08 | Paper |
Complexity of buffer capacity allocation problems for production lines with unreliable machines
Journal of Mathematical Modelling and Algorithms in Operations Research | 2013-09-26 | Paper |
Strong NP-hardness of scheduling problems with learning or aging effect
Annals of Operations Research | 2013-09-03 | Paper |
Soft due window assignment and scheduling of unit-time jobs on parallel machines
4OR | 2013-02-18 | Paper |
Two-agent scheduling on an unbounded serial batching machine
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
Discrete Optimization | 2012-07-12 | Paper |
Scheduling a single server in a two-machine flow shop
Computing | 2012-06-04 | Paper |
Multi-product lot-sizing and sequencing on a single imperfect machine
Computational Optimization and Applications | 2012-04-12 | Paper |
Scheduling an unbounded batching machine with job processing time compatibilities
Discrete Applied Mathematics | 2012-03-19 | Paper |
Minimizing the number of late jobs on a single machine under due date uncertainty
Journal of Scheduling | 2012-01-16 | Paper |
Batch scheduling of deteriorating products
Decision Making in Manufacturing and Services | 2011-06-28 | Paper |
An FPTAS for a supply scheduling problem with non-monotone cost functions
Naval Research Logistics | 2011-04-28 | Paper |
The simplified partial digest problem: approximation and a graph-theoretic model
European Journal of Operational Research | 2011-01-28 | Paper |
Creative heritage of Vyacheslav Sergeevich Tanaev: seventieth anniversary
Automation and Remote Control | 2011-01-03 | Paper |
A generic approach to proving NP-hardness of partition type problems
Discrete Applied Mathematics | 2010-11-25 | Paper |
| Computational complexity of the product partition problem | 2010-10-14 | Paper |
Internet shopping optimization problem
International Journal of Applied Mathematics and Computer Science | 2010-09-02 | Paper |
On the approximability of the simplified partial digest problem
Discrete Applied Mathematics | 2010-04-28 | Paper |
Lot-Sizing and Sequencing on a Single Imperfect Machine
Communications in Computer and Information Science | 2009-05-13 | Paper |
Approximate solution of the control problem of supplies with many intervals and concave cost functions
Automation and Remote Control | 2009-05-07 | Paper |
| Single machine scheduling problems with exponentially start time dependent job processing times | 2009-01-20 | Paper |
Scheduling jobs in a contaminated area: a model and heuristic algorithms
The Journal of the Operational Research Society | 2008-08-14 | Paper |
A single-item economic lot-sizing problem with a non-uniform resource: Approximation
European Journal of Operational Research | 2008-04-24 | Paper |
Batch scheduling of deteriorating reworkables
European Journal of Operational Research | 2008-04-24 | Paper |
Optimal testing and repairing a failed series system
Journal of Combinatorial Optimization | 2007-06-21 | Paper |
Batching deteriorating items with applications in computer communication and reverse logistics
European Journal of Operational Research | 2007-06-13 | Paper |
| Job sequencing with exponential functions of processing times | 2007-01-29 | Paper |
Problem \(F2||C_{\max}\) with forbidden jobs in the first or last position is easy
European Journal of Operational Research | 2006-12-07 | Paper |
Scheduling with controllable release dates and processing times: Makespan minimization
European Journal of Operational Research | 2006-10-27 | Paper |
Scheduling with controllable release dates and processing times: total completion time minimization
European Journal of Operational Research | 2006-10-27 | Paper |
An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
Mathematical Programming. Series A. Series B | 2006-06-14 | Paper |
Scheduling in a contaminated area: a model and polynomial algorithms
European Journal of Operational Research | 2006-05-29 | Paper |
Batching work and rework processes with limited deterioration of reworkables
Computers & Operations Research | 2006-01-10 | Paper |
Batch scheduling with controllable setup and processing times to minimize total completion time
The Journal of the Operational Research Society | 2005-06-21 | Paper |
Positive half-products and scheduling with controllable processing times
European Journal of Operational Research | 2005-04-21 | Paper |
Single machine group scheduling with resource dependent setup and processing times
European Journal of Operational Research | 2005-02-09 | Paper |
Batching decisions for assembly production systems
European Journal of Operational Research | 2005-01-12 | Paper |
Maximization problems in single machine scheduling
Annals of Operations Research | 2004-08-10 | Paper |
Scheduling malleable tasks on parallel processors to minimize the makespan
Annals of Operations Research | 2004-08-10 | Paper |
Scheduling jobs with piecewise linear decreasing processing times
Naval Research Logistics | 2004-03-15 | Paper |
Single machine batch scheduling with jointly compressible setup and processing times.
European Journal of Operational Research | 2004-01-05 | Paper |
An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note
Computers & Operations Research | 2003-04-02 | Paper |
The complexity of two group scheduling problems
Journal of Scheduling | 2003-02-23 | Paper |
A polynomial algorithm for lot-size scheduling of two type tasks.
Information Processing Letters | 2003-01-21 | Paper |
Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
Journal of Heuristics | 2002-12-15 | Paper |
Minimizing the total weighted completion time of deteriorating jobs
Information Processing Letters | 2002-07-14 | Paper |
Fast fully polynomial approximation schemes for minimizing completion time variance
European Journal of Operational Research | 2002-06-16 | Paper |
Single supplier scheduling for multiple deliveries
Annals of Operations Research | 2002-06-09 | Paper |
Parallel machine batching and scheduling with deadlines
Journal of Scheduling | 2001-12-05 | Paper |
| scientific article; zbMATH DE number 1594561 (Why is no real title available?) | 2001-05-06 | Paper |
A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
Operations Research | 2001-02-27 | Paper |
Scheduling with batching: A review
European Journal of Operational Research | 2001-01-30 | Paper |
Single machine batch scheduling with resource dependent setup and processing times
European Journal of Operational Research | 2001-01-01 | Paper |
Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness
European Journal of Operational Research | 1999-11-29 | Paper |
| scientific article; zbMATH DE number 1294371 (Why is no real title available?) | 1999-08-08 | Paper |
Batch scheduling with deadlines on parallel machines
Annals of Operations Research | 1999-03-07 | Paper |
Single machine scheduling with batch deliveries
European Journal of Operational Research | 1999-02-22 | Paper |
Single machine scheduling subject to deadlines and resource dependent processing times
European Journal of Operational Research | 1999-02-22 | Paper |
Scheduling a batching machine
Journal of Scheduling | 1999-01-11 | Paper |
A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
Journal of Heuristics | 1999-01-05 | Paper |
Batch scheduling and common due date assignment problem: An NP-hard case
Discrete Applied Mathematics | 1998-08-19 | Paper |
Uniform machine scheduling of unit-time jobs subject to resource constraints
Discrete Applied Mathematics | 1998-07-28 | Paper |
A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\)
Operations Research Letters | 1998-07-06 | Paper |
Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
SIAM Journal on Optimization | 1998-05-12 | Paper |
| scientific article; zbMATH DE number 988191 (Why is no real title available?) | 1997-07-06 | Paper |
Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
SIAM Journal on Optimization | 1997-06-12 | Paper |
Batch scheduling and common due-date assignment on a single machine
Discrete Applied Mathematics | 1997-01-06 | Paper |
Single machine batch scheduling with deadlines and resource dependent processing times
Operations Research Letters | 1996-10-20 | Paper |
Single Machine Group Scheduling with Two Ordered Criteria
The Journal of the Operational Research Society | 1996-09-26 | Paper |
| scientific article; zbMATH DE number 866105 (Why is no real title available?) | 1996-04-16 | Paper |
Improving the complexities of approximation algorithms for optimization problems
Operations Research Letters | 1996-01-07 | Paper |
| scientific article; zbMATH DE number 781252 (Why is no real title available?) | 1995-11-30 | Paper |
Single machine group scheduling with ordered criteria
Annals of Operations Research | 1995-08-27 | Paper |
| scientific article; zbMATH DE number 778418 (Why is no real title available?) | 1995-08-27 | Paper |
A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
Mathematics of Operations Research | 1994-11-17 | Paper |
| scientific article; zbMATH DE number 569960 (Why is no real title available?) | 1994-05-18 | Paper |
| scientific article; zbMATH DE number 1294421 (Why is no real title available?) | 1993-01-01 | Paper |
| scientific article; zbMATH DE number 67593 (Why is no real title available?) | 1992-09-27 | Paper |
Minimization of the weighted sum of overdue customers in a single-server system
Computational Mathematics and Mathematical Physics | 1992-09-26 | Paper |
| scientific article; zbMATH DE number 16428 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 4217092 (Why is no real title available?) | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4131936 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4146949 (Why is no real title available?) | 1990-01-01 | Paper |
Approximation scheduling algorithms: a survey
Optimization | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4068905 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4045467 (Why is no real title available?) | 1988-01-01 | Paper |
The construction of ε-approximate algorithms for the optimization of functions in successively constructed sets
USSR Computational Mathematics and Mathematical Physics | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3908183 (Why is no real title available?) | 1985-01-01 | Paper |
