上游充通大￥ SHANGHAI JIAO TONG UNIVERSITY 1896 1920 1987 2006 Production Planning and Control Professor JIANG Zhibin Dr.GENG Na Department of Industrial Engineering Logistics Management Shanghai Jiao Tong University IAO TONG
1896 1920 1987 2006 Production Planning and Control Professor JIANG Zhibin Dr. GENG Na Department of Industrial Engineering & Logistics 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
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
Supply Chain Management The clearest description appeared in a Fortune magazine article devoted to the subject: Call it distribution or logistics or supply chain management.By whatever name,it is the sinuous,gritty,and cumbersome process by which companies move material,parts,and products to customers.In industry after industry,from cars and clothing to computers and chemicals,executives have plucked this once dismal discipline off the loading dock and placed it near the top of the corporate agenda.Hard-pressed to knock out competitors on quality or price,companies are trying to gain an edge through their ability to deliver the right stuff in the right amount at the right time. (Henkoff,1994)
Supply Chain Management The clearest description appeared in a Fortune magazine article devoted to the subject: Call it distribution or logistics or supply chain management. By whatever name, it is the sinuous, gritty, and cumbersome process by which companies move material, parts, and products to customers. In industry after industry, from cars and clothing to computers and chemicals, executives have plucked this once dismal discipline off the loading dock and placed it near the top of the corporate agenda. Hard-pressed to knock out competitors on quality or price, companies are trying to gain an edge through their ability to deliver the right stuff in the right amount at the right time. (Henkoff, 1994)
Transportation Problem Solve TP by Greedy Heuristic:sub-optimal The total cost- 45×250+35×,1280+ Min(45,80) Min(78,120) .=S304,900, Factories Warehouse (Sinks) Amarillo Teaneck Chicago Siouk Falls (sources) 250 420 380 280 Sunnyvale 5 45 1,280 990 1,440 1,520 Dublin 35 78 120 1,550 1,420 1,660 1,730 Bangkok 40 5 95 80 78 47 55 Min(80-45,120-78) Min(120-35-78,47) Min(47-7,95)
Solve TP by Greedy Heuristic: sub-optimal Transportation Problem Amarillo Teaneck Chicago Sioux Falls Warehouse (Sinks) Factories (sources) Sunnyvale Dublin Bangkok 250 420 380 280 1,280 990 1,440 1,520 1,550 1,420 1,660 1,730 45 120 95 80 78 47 55 55 45 Min (45, 80) 78 Min (78, 120) 35 Min (80-45, 120-78) 7 Min (120-35-78, 47) 40 Min(47-7, 95) The total cost= 45 250+35 ,1280+ …=$304,900
Transportation Problem Solve TP by LP 。 Let m (=3)be the number of sources and n(=4)be the number of sinks, a;=the supply from the source i,1s ism bi=the demand of sink j,1sjsn; cthe cost of shipping one unit from source i to sink j; Xthe flow from the source i to sink j for 1s ism and 1sj<n; m n Subject to Min ∑∑， i=1 j=l S4gpW:∑y=a,or1≤i≤m i=l Dend:∑x=b,or1sjsr Nonegtive:x,≥0，for1≤i≤nand1≤j≤n
Solve TP by LP • Let m (=3) be the number of sources and n (=4) be the number of sinks; • ai= the supply from the source i, 1 im • bj =the demand of sink j, 1jn; • cij =the cost of shipping one unit from source i to sink j; • xij=the flow from the source i to sink j for 1 im and 1jn; Transportation Problem 1 1 m n ij ij i j Min c x Subject to 1 1 : ,1 ; : ,1 ; : 0, 1 1 n ij i j m ij j i ij Supply x a for i m Demand x b for j n Nonegtive x for i mand j n