The following pages link to Yoshiyuki Karuno (Q898724):
Displaying 20 items.
- Pseudo-polynomial time algorithms for combinatorial food mixture packing problems (Q898726) (← links)
- Vehicle scheduling on a tree with release and handling times (Q1357781) (← links)
- 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. (Q1406038) (← links)
- An approximability result of the multi-vehicle scheduling problem on a path with release and handling times (Q1884949) (← links)
- AN INAPPROXIMABILITY OF TRANSSHIPMENT PROBLEMS WITH PERMUTABLE TRANSIT VECTORS (Q3006910) (← links)
- Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks (Q3150129) (← links)
- (Q3368663) (← links)
- (Q4268432) (← links)
- VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS (Q4345053) (← links)
- OPTIMAL SCHEDULING FOR AN AUTOMATED m-MACHINE FLOWSHOP (Q4366147) (← links)
- (Q4425954) (← links)
- (Q4474072) (← links)
- A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM (Q4483536) (← links)
- (Q4494938) (← links)
- (Q4796177) (← links)
- CONSTANT FACTOR APPROXIMATION ALGORITHMS FOR REPETITIVE ROUTING PROBLEMS OF GRASP-AND-DELIVERY ROBOTS IN PRODUCTION OF PRINTED CIRCUIT BOARDS (Q4925657) (← links)
- (Q4937177) (← links)
- Algorithms and Computation (Q5191659) (← links)
- ANALYSIS AND OPTIMIZATION FOR AUTOMATED VEHICLE ROUTING ON A SINGLE LOOP(<Special Issue>Advanced Planning and Scheduling for Supply Chain Management) (Q5423044) (← links)
- Approximating the Bipartite TSP and Its Biased Generalization (Q5746245) (← links)