Moshe Kaspi

Orcid: 0000-0003-4131-9707

According to our database1, Moshe Kaspi authored at least 17 papers between 2001 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Minimizing the average searching time for an object within a graph.
Comput. Optim. Appl., 2019

Maximizing the profit per unit time for the travelling salesman problem.
Comput. Ind. Eng., 2019

2018
Optimal operation policy for a sustainable recirculation aquaculture system for ornamental fish: Simulation and response surface methodology.
Comput. Oper. Res., 2018

2017
Maximizing the profit per unit of time for the TSP with convex resource-dependent travelling times.
J. Oper. Res. Soc., 2017

2016
Parameterized complexity of critical node cuts.
Theor. Comput. Sci., 2016

2015
Erratum to: A survey on offline scheduling with rejection.
J. Sched., 2015

2013
A survey on offline scheduling with rejection.
J. Sched., 2013

2011
Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling.
Discret. Appl. Math., 2011

2007
A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine.
J. Sched., 2007

Centralized decision of internal transfer-prices with congestion externalities for two modes of repair with limited repair capacity.
J. Oper. Res. Soc., 2007

Multi Observer 3D Visual Area Coverage Scheduling Using Decomposition Methodologies.
Proceedings of the 2007 International Conference on Artificial Intelligence, 2007

2006
Parallel machine scheduling with a convex resource consumption function.
Eur. J. Oper. Res., 2006

A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates.
Comput. Oper. Res., 2006

2005
Multi Agent Visual Area Coverage Strategies using an Adaptive Queen Genetic Algorithm.
Proceedings of the IASTED International Conference on Artificial Intelligence and Applications, 2005

2004
Minimizing the total weighted flow time in a single machine with controllable processing times.
Comput. Oper. Res., 2004

Convex resource allocation for minimizing the makespan in a single machine with job release dates.
Comput. Oper. Res., 2004

2001
Setting expediting repair policy in a multi-echelon repairable-item inventory system with limited repair capacity.
J. Oper. Res. Soc., 2001


  Loading...