Two dynamic programming approaches for treating sequencing problems-one proposed by Schrage and Baker and the other by Lawler-are discussed in the context of an assembly line balancing problem. A ...
Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming
This paper considers a minimum-cost network flow problem in a bipartite graph with a single sink. The transportation costs exhibit a staircase cost structure because such types of transportation cost ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback