| Publication | Date of Publication | Type |
|---|
Work package sizing and project performance
Operations Research | 2020-10-12 | Paper |
Dynamic lot sizing with all-units discount and resales
Naval Research Logistics | 2019-03-05 | Paper |
Polynomial-time solvability of dynamic lot size problems
Asia-Pacific Journal of Operational Research | 2016-08-12 | Paper |
Multitasking via alternate and shared processing: algorithms and complexity
Discrete Applied Mathematics | 2016-05-18 | Paper |
Faster algorithms for single machine scheduling with release dates and rejection
Information Processing Letters | 2016-05-10 | Paper |
Fully polynomial time approximation schemes for stochastic dynamic programs
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries
Theoretical Computer Science | 2015-01-30 | Paper |
Multiple subset sum with inclusive assignment set restrictions
Naval Research Logistics | 2013-06-27 | Paper |
Berth allocation with time-dependent physical limitations on vessels
European Journal of Operational Research | 2012-05-14 | Paper |
Flexible and risk-sharing supply contracts under price uncertainty
Management Science | 2012-02-12 | Paper |
Approximation results for min-max path cover problems in vehicle routing
Naval Research Logistics | 2011-01-06 | Paper |
scientific article; zbMATH DE number 5764859 (Why is no real title available?)
| 2010-08-06 | Paper |
Scheduling parallel machines with inclusive processing set restrictions and job release times
European Journal of Operational Research | 2009-12-10 | Paper |
Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
Operations Research Letters | 2009-08-14 | Paper |
Dynamic Lot Sizing with Batch Ordering and Truckload Discounts
Operations Research | 2009-07-14 | Paper |
A new solution method for the finite-horizon discrete-time EOQ problem
European Journal of Operational Research | 2009-04-08 | Paper |
A note on unrelated parallel machine scheduling with time-dependent processing times
The Journal of the Operational Research Society | 2009-03-03 | Paper |
Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Scheduling parallel machines with inclusive processing set restrictions
Naval Research Logistics | 2008-08-11 | Paper |
An asymptotic approximation scheme for the concave cost bin packing problem
European Journal of Operational Research | 2008-07-21 | Paper |
Quantifying supply chain ineffectiveness under uncoordinated pricing decisions
Operations Research Letters | 2008-05-29 | Paper |
An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs
Computers \& Operations Research | 2008-04-28 | Paper |
The impact of manufacturer rebates on supply chain profits
Naval Research Logistics | 2008-01-23 | Paper |
Bin‐packing problem with concave costs of bin utilization
Naval Research Logistics | 2008-01-23 | Paper |
Machine scheduling with pickup and delivery
Naval Research Logistics | 2008-01-23 | Paper |
Scheduling unit-length jobs with machine eligibility restrictions
European Journal of Operational Research | 2006-09-13 | Paper |
Improved algorithm for maximizing service of carousel storage
Computers \& Operations Research | 2005-09-02 | Paper |
Machine scheduling with deliveries to multiple customer locations
European Journal of Operational Research | 2005-02-09 | Paper |
Lot streaming with supplier-manufacturer coordination
Naval Research Logistics | 2005-01-11 | Paper |
Interblock Crane Deployment in Container Terminals
Transportation Science | 2003-07-07 | Paper |
A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis
Operations Research Letters | 2003-04-02 | Paper |
Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
Information Processing Letters | 2002-07-14 | Paper |
Analysis of a new vehicle scheduling and location problem
Naval Research Logistics | 2002-03-14 | Paper |
Minimizing total completion time in two-processor task systems with prespecified processor allocations
| 1999-06-27 | Paper |
Scheduling with agreeable release times and due dates on a batch processing machine
European Journal of Operational Research | 1999-04-27 | Paper |
Scheduling to minimize the total compression and late costs
| 1998-03-25 | Paper |
Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
Operations Research Letters | 1997-08-07 | Paper |
On the fixed interval due-date scheduling problem
Discrete Applied Mathematics | 1996-10-03 | Paper |
Scheduling to minimize release-time resource consumption and tardiness penalties
| 1996-09-15 | Paper |
A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs
Computers \& Operations Research | 1995-05-30 | Paper |
The parallel machine min-max weighted absolute lateness scheduling problem
| 1995-03-15 | Paper |
Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
Computers \& Operations Research | 1995-01-11 | Paper |
Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption
Mathematical and Computer Modelling | 1995-01-11 | Paper |
Scheduling with resource-dependent release dates—a comparison of two different resource consumption functions
| 1994-12-01 | Paper |
Probabilistic Analysis of a Vehicle Routing Problem with Time Windows
American Journal of Mathematical and Management Sciences | 1994-10-12 | Paper |
A note on one-processor scheduling with asymmetric earliness and tardiness penalties
Operations Research Letters | 1993-08-16 | Paper |
On the Distance Constrained Vehicle Routing Problem
Operations Research | 1993-01-17 | Paper |
Finding disjoint paths with different path-costs: Complexity and algorithms
Networks | 1993-01-17 | Paper |
Analysis of heuristics for the design of tree networks
Annals of Operations Research | 1993-01-16 | Paper |
Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
ORSA Journal on Computing | 1993-01-16 | Paper |
Dynamic programming approach to the \(n/m/\)parallel\(/\sum_{i=1}^{m} \{\sum {w_ j} \sum {t_ j} \}\) scheduling problem
Applied Mathematics Letters | 1993-01-05 | Paper |
On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
Operations Research Letters | 1992-12-17 | Paper |
The point-to-point delivery and connection problems: Complexity and algorithms
Discrete Applied Mathematics | 1992-09-27 | Paper |
Equipartitions of graphs
Discrete Mathematics | 1992-06-28 | Paper |
The complexity of finding two disjoint paths with min-max objective function
Discrete Applied Mathematics | 1990-01-01 | Paper |
