上海交通大学机械与动力工程学院工业工程与管理系生产计划与控制Chapter6lecture2 Generalizations of the Transportation.pdfVIP

Production and Operation Managements Scheduling in Supply Chain Management Prof. JAING Zhibin Dr GENG Na Department of Industrial Engineering Management Shanghai Jiao Tong University Scheduling in Supply Chain Management Contents • Introduction • Transportation Problem • Generalizations of the Transportation; • More General Network Formulations • Distribution Resources Planning; • Determining Delivery Routes in Supply Chain • The Role of information in the SCM • Multilevel Distribution Systems • Designing the Supply Chain in a Global Environment Generalizations of the Transportation • Infeasible Routes  Eliminate routes from some sources to some sinks=Set the costs of these routes very high;  Traditionally M is used to denote the very high cost. However, in practice, costs of these routes are assigned numbers much larger than the costs of other feasible routes, so that optimal solution will never assign flow to these routes. Generalizations of the Transportation • Unbalanced Problems The total amount shipped from the sources is not equal to the total amount required at the sinks. Occurs when the demand exceeds the supply or vice versa. Two measures either add a dummy row or a dummy column to absorb the excess supply or demand; Alter the appropriate set of constraints to either or form. Generalizations of the Transportation • Suppose that the demand for the drives was higher than anticipated. The anticipated demand for the four sinks: 80 78 47 55 (the anticipated total demand is 260) The actual demands: 90 78 55 55 (the actual total demand is 278) • Treatments to turn into balanced problem in Greedy Heuristic