| |
| 2008 | ||
|---|---|---|
| 9 | EE | Dvir Shabtay: Due date assignments and scheduling a single machine with a general earliness/tardiness cost function. Computers & OR 35(5): 1539-1545 (2008) |
| 2007 | ||
| 8 | EE | Dvir Shabtay, George Steiner: A survey of scheduling with controllable processing times. Discrete Applied Mathematics 155(13): 1643-1666 (2007) |
| 7 | EE | Liron Yedidsion, Dvir Shabtay, Moshe Kaspi: A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine. J. Scheduling 10(6): 341-352 (2007) |
| 2006 | ||
| 6 | EE | Moshe Kaspi, Dvir Shabtay: A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates. Computers & OR 33(10): 3015-3033 (2006) |
| 5 | EE | Dvir Shabtay, Moshe Kaspi: Parallel machine scheduling with a convex resource consumption function. European Journal of Operational Research 173(1): 92-107 (2006) |
| 4 | EE | Dvir Shabtay, George Steiner: Two due date assignment problems in scheduling a single machine. Oper. Res. Lett. 34(6): 683-691 (2006) |
| 2004 | ||
| 3 | EE | Dvir Shabtay, Moshe Kaspi: Minimizing the total weighted flow time in a single machine with controllable processing times. Computers & OR 31(13): 2279-2289 (2004) |
| 2 | EE | Dvir Shabtay: Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine. Computers & OR 31(8): 1303-1315 (2004) |
| 1 | EE | Moshe Kaspi, Dvir Shabtay: Convex resource allocation for minimizing the makespan in a single machine with job release dates. Computers & OR 31(9): 1481-1489 (2004) |
| 1 | Moshe Kaspi | [1] [3] [5] [6] [7] |
| 2 | George Steiner | [4] [8] |
| 3 | Liron Yedidsion | [7] |