 | 2011 |
|---|
| 8 |       | Liron Yedidsion,
Dvir Shabtay,
Moshe Kaspi:
Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling.
Discrete Applied Mathematics 159(12): 1264-1278 (2011) |
| 2007 |
|---|
| 7 |  | Helman Stern,
Moshe Zofi,
Moshe Kaspi:
Multi Observer 3D Visual Area Coverage Scheduling Using Decomposition Methodologies.
IC-AI 2007: 114-120 |
| 6 | | 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 |
|---|
| 5 | | 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) |
| 4 | | Dvir Shabtay,
Moshe Kaspi:
Parallel machine scheduling with a convex resource consumption function.
European Journal of Operational Research 173(1): 92-107 (2006) |
| 2005 |
|---|
| 3 | | Helman Stern,
Yoash Chassidim,
Moshe Zofi,
Moshe Kaspi:
Multi Agent Visual Area Coverage Strategies using an Adaptive Queen Genetic Algorithm.
Artificial Intelligence and Applications 2005: 118-124 |
| 2004 |
|---|
| 2 | | 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) |
| 1 | | 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) |
Data released under the ODC-BY 1.0 license — See also our legal information page