Sciweavers

SODA
2016
ACM

Make-to-Order Integrated Scheduling and Distribution

7 years 11 months ago
Make-to-Order Integrated Scheduling and Distribution
Production and distribution are fundamental operational functions in supply chains. The main challenge is to design algorithms that optimize operational performance by jointly scheduling production and delivery of customer orders. In this paper we study a model of scheduling customer orders on multiple identical machines and their distribution to customers afterwards. The goal is to minimize the total time from release to distribution plus total distribution cost to the customers. We design the first poly-logarithmic competitive algorithm for the problem, improving upon previous algorithms with linear competitive ratios. Our model generalizes two fundamental problems: scheduling of jobs on multiple identical machines (where the goal function is to minimize the total flow time) as well as the TCP Acknowledgment problem.
Yossi Azar, Amir Epstein, Lukasz Jez, Adi Vardi
Added 09 Apr 2016
Updated 09 Apr 2016
Type Journal
Year 2016
Where SODA
Authors Yossi Azar, Amir Epstein, Lukasz Jez, Adi Vardi
Comments (0)