供应链
计算机科学
调度(生产过程)
缩小
动态优先级调度
总成本
运筹学
供应链管理
作业车间调度
数学优化
运营管理
业务
微观经济学
地铁列车时刻表
经济
数学
操作系统
程序设计语言
营销
作者
Nicholas G. Hall,Chris N. Potts
出处
期刊:Operations Research
[Institute for Operations Research and the Management Sciences]
日期:2003-08-01
卷期号:51 (4): 566-584
被引量:451
标识
DOI:10.1287/opre.51.4.566.16106
摘要
Although the supply chain management literature is extensive, the benefits and challenges of coordinated decision making within supply chain scheduling models have not been studied. We consider a variety of scheduling, batching, and delivery problems that arise in an arborescent supply chain where a supplier makes deliveries to several manufacturers, who also make deliveries to customers. The objective is to minimize the overall scheduling and delivery cost, using several classical scheduling objectives. This is achieved by scheduling the jobs and forming them into batches, each of which is delivered to the next downstream stage as a single shipment. For each problem, we either derive an efficient dynamic programming algorithm that minimizes the total cost of the supplier or that of the manufacturer, or we demonstrate that this problem is intractable. The total system cost minimization problem of a supplier and manufacturer who make cooperative decisions is also considered. We demonstrate that cooperation between a supplier and a manufacturer may reduce the total system cost by at least 20%, or 25%, or by up to 100%, depending upon the scheduling objective. Finally, we identify incentives and mechanisms for this cooperation, thereby demonstrating that our work has practical implications for improving the efficiency of supply chains.
科研通智能强力驱动
Strongly Powered by AbleSci AI