2 citations · 2 across the 3 of their papers we have counts for
Showing 2013 · cs.DSShow all
2 papers · 2 filters
cs.DS2013
Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms
Kameng Nip, Zhenbo Wang, Wenxun Xing
We consider several combinatorial optimization problems which combine the classic shop scheduling problems, namely open shop scheduling or job shop scheduling, and the shortest pat…
cs.DS2013
A Combination of Flow Shop Scheduling and the Shortest Path Problem
Kameng Nip, Zhenbo Wang, Fabrice Talla Nobibon +1
This paper studies a combinatorial optimization problem which is obtained by combining the flow shop scheduling problem and the shortest path problem. The objective of the obtained…