The following pages link to Moshe Kaspi (Q398829):
Displayed 18 items.
- A survey on offline scheduling with rejection (Q398830) (← links)
- Parameterized complexity of critical node cuts (Q517024) (← links)
- A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine (Q954246) (← links)
- Optimal operation policy for a sustainable recirculation aquaculture system for ornamental fish: simulation and response surface methodology (Q1652474) (← links)
- Convex resource allocation for minimizing the makespan in a single machine with job release dates (Q1881652) (← links)
- Minimizing the total weighted flow time in a single machine with controllable processing times (Q1886005) (← links)
- Minimizing the average searching time for an object within a graph (Q2007833) (← links)
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933) (← links)
- Erratum to: ``A survey on offline scheduling with rejection'' (Q2356127) (← links)
- A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates (Q2489138) (← links)
- Parallel machine scheduling with a convex resource consumption function (Q2491771) (← links)
- The effectiveness of heuristic algorithms for multi-item inventory systems with joint replenishment costs (Q3686388) (← links)
- Note—A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions (Q3750465) (← links)
- Optimization of the machining economics problem under the periodic control strategy (Q4443304) (← links)
- Optimization of the machining economics problem for a multistage transfer machine under failure, opportunistic and integrated replacement strategies (Q4474695) (← links)
- The efficiency range of economical cutting conditions and tool replacement under the age replacement strategy (Q4474700) (← links)
- Parameterized Complexity of Critical Node Cuts (Q5363787) (← links)
- Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function (Q5471126) (← links)