| Shared Processor Scheduling of Multiprocessor Jobs | 0 | 0.34 | 2020 |
| Shared processor scheduling. | 0 | 0.34 | 2018 |
| Shared multi-processor scheduling. | 0 | 0.34 | 2017 |
| Normal-form preemption sequences for an open problem in scheduling theory | 1 | 0.35 | 2016 |
| The complexity of minimum-length path decompositions | 3 | 0.42 | 2015 |
| Scheduling semi-malleable jobs to minimize mean flow time | 2 | 0.38 | 2015 |
| Decentralized subcontractor scheduling with divisible jobs | 0 | 0.34 | 2015 |
| Asymptotic behavior of optimal quantities in symmetric transshipment coalitions | 0 | 0.34 | 2014 |
| Optimal edge-coloring with edge rate constraints. | 0 | 0.34 | 2013 |
| A branch and bound algorithm for the response time variability problem | 3 | 0.43 | 2013 |
| On Transshipment Games with Identical Newsvendors | 1 | 0.36 | 2013 |
| Minimum length path decompositions | 2 | 0.41 | 2013 |
| Transshipment games with identical newsvendors and cooperation costs. | 2 | 0.39 | 2013 |
| A coordinating contract for transshipment in a two-company supply chain | 11 | 0.66 | 2010 |
| A projective algorithm for preemptive open shop scheduling with two multiprocessor groups | 1 | 0.34 | 2010 |
| Mathematical programming modeling of the Response Time Variability Problem | 7 | 0.53 | 2010 |
| Apportionment methods and the Liu-Layland problem | 1 | 0.39 | 2009 |
| Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors | 1 | 0.35 | 2009 |
| Just-in-Time Smoothing Through Batching | 2 | 0.41 | 2008 |
| Preemptive open shop scheduling with multiprocessors: polynomial cases and applications | 4 | 0.45 | 2008 |
| Response time variability | 15 | 0.88 | 2007 |
| Minimization of ordered, symmetric half-products | 9 | 0.82 | 2005 |
| Positive half-products and scheduling with controllable processing times | 21 | 1.08 | 2005 |
| A half-product based approximation scheme for agreeably weighted completion time variance | 7 | 0.50 | 2005 |
| Solution of The Liu–Layland Problem Via Bottleneck Just-In-Time Sequencing | 1 | 0.42 | 2005 |
| Cyclic Just-In-Time Sequences Are Optimal | 4 | 0.60 | 2003 |
| Fast fully polynomial approximation schemes for minimizing completion time variance | 13 | 0.69 | 2002 |
| Complexity of list coloring problems with a fixed total number of colors | 4 | 0.48 | 2002 |
| Two-machine flow shops with limited machine availability | 49 | 3.04 | 2002 |
| Tree precedence in scheduling: The strong–weak distinction | 1 | 0.36 | 1999 |
| On the complexity of a restricted list-coloring problem | 7 | 0.61 | 1999 |
| A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem | 38 | 2.32 | 1999 |
| Scheduling identical jobs with chain precedence constraints on two uniform machines | 20 | 1.41 | 1999 |
| Scheduling parallel tasks withsequential heads and tails | 1 | 0.35 | 1999 |
| Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs | 8 | 0.80 | 1998 |
| A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs | 36 | 3.33 | 1998 |
| Scheduling chains to minimize mean flow time | 7 | 0.81 | 1997 |
| Algorithms for minclique scheduling problems | 15 | 1.67 | 1997 |
| Optimal level schedules for mixed-model, multi-level just-in-time assembly systems | 11 | 2.11 | 1997 |
| An efficient algorithm for a job shop problem | 6 | 1.45 | 1995 |
| New results on the completion time variance minimization | 32 | 2.75 | 1995 |
| Scheduling shops to minimize the weighted number of late jobs | 23 | 2.25 | 1994 |
| Completion time variance minimization on a single machine is difficult | 48 | 3.76 | 1993 |
| Proof of a conjecture of Schrage about the completion time variance problem | 24 | 3.24 | 1991 |
| Earliness-tardiness scheduling problems: II. Derivation of completion times about a restrictive common due date | 94 | 18.39 | 1991 |
| Minimizing mean flow-time with parallel processors and resource constraints | 5 | 0.57 | 1987 |
