Static Scheduling Model and Algorithms of Agile Supply Chain Under Definite Demands
In this paper we study the static scheduling problems of definite market demands with time constraints in agile supply chains, which consist of multi-stage members with limited capacities. We establish a framework model to picture the supply chains structure and an integer nonlinear programming (INLP) model to describe the scheduling problem. Then we design a two-step algorithm with lower complexity to resolve the INLP model. 1) the shortest response time scheduling algorithm to judge whether the supply chain can meet the demands time constraints, 2) the lean scheduling algorithm to abtain the minimum inventory cost of the supply chain.Finally, we verify the practicality and effectiveness of the model and algorithms by a numeric experiment.
agile supply chain static scheduling INLP shortest response time scheduling lean scheduling
Wang Jianhua Li Nan Guo Hui
College of Economics and Management, Nanjing University of Aeronautics and Astronautics, Nanjing Sch College of Economics and Management, Nanjing University of Aeronautics and Astronautics, Nanjing
国际会议
长沙
英文
2910-2913
2009-10-10（万方平台首次上网日期，不代表论文的发表时间）