| Publication | Date of Publication | Type |
|---|
| Online production planning to maximize the number of on-time orders | 2021-05-05 | Paper |
| Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs | 2020-03-06 | Paper |
| Erratum to: ``Flow shops with WIP and value added costs | 2015-07-28 | Paper |
| Sensitivity analysis for scheduling problems | 2015-01-22 | Paper |
| A large class of facets for the \(K\)-median polytope | 2011-06-17 | Paper |
| Online Scheduling with Known Arrival Times | 2011-04-27 | Paper |
| The Generation of Experimental Data for Computational Testing in Optimization | 2010-12-22 | Paper |
| Flow shops with WIP and value added costs | 2010-05-07 | Paper |
| Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures | 2009-08-13 | Paper |
| Generating Experimental Data for Computational Testing with Machine Scheduling Applications | 2009-07-03 | Paper |
| Sensitivity analysis for scheduling problems | 2007-12-20 | Paper |
| Allocation of jobs and identical resources with two pooling centers | 2007-06-14 | Paper |
| Scheduling parallel machines for the customer order problem | 2007-05-15 | Paper |
| Polyhedral properties of the \(K\)-median problem on a tree | 2007-05-10 | Paper |
| The complexity of cyclic shop scheduling problems | 2002-08-08 | Paper |
| High Multiplicity in Earliness-Tardiness Scheduling | 2002-06-04 | Paper |
| Scheduling with Finite Capacity Input Buffers | 2002-03-18 | Paper |
| Scheduling with Finite Capacity Output Buffers | 2002-02-07 | Paper |
| Parallel machine scheduling with high multiplicity | 2001-04-24 | Paper |
| Preemptive scheduling with finite capacity input buffers | 1997-12-04 | Paper |
| Performance Measures and Schedules in Periodic Job Shops | 1997-11-25 | Paper |
| Approximation Procedures for the One-Warehouse Multi-Retailer System | 1995-10-09 | Paper |
| An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity | 1993-06-29 | Paper |
| Scheduling with release dates on a single machine to minimize total weighted completion time | 1992-09-27 | Paper |
| Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date | 1992-06-28 | Paper |
| Reducibility among single machine weighted completion time scheduling problems | 1990-01-01 | Paper |
| The Deadline Constrained Weighted Completion Time Problem: Analysis of a Heuristic | 1988-01-01 | Paper |
| The Single Machine Problem with a Quadratic Cost Function of Completion Times | 1988-01-01 | Paper |
| A dual approach for the continuous collapsing knapsack problem | 1987-01-01 | Paper |
| On optimal decision rules for signs of parameters | 1986-01-01 | Paper |
| A Sequencing Problem with Release Dates and Clustered Jobs | 1986-01-01 | Paper |
| Minimizing Weighted Completion Times with Deadlines | 1985-01-01 | Paper |
| The Caterer Problem | 1985-01-01 | Paper |
| Transshipment along a single road | 1985-01-01 | Paper |
| The tridiagonal transportation problem | 1984-01-01 | Paper |
| A Transportation Type Aggregate Production Model with Backordering | 1983-01-01 | Paper |
| The continuous collapsing Knapsack problem | 1983-01-01 | Paper |
| Linear max-min programming | 1981-01-01 | Paper |
| A note on a programming problem with maximin objective function | 1978-01-01 | Paper |
| The Collapsing 0–1 Knapsack Problem | 1978-01-01 | Paper |
| The decomposition of nonlinear problems | 1978-01-01 | Paper |
