TY - GEN
T1 - Make-to-order integrated scheduling and distribution
AU - Azar, Yossi
AU - Epstein, Amir
AU - Jez, Lukasz
AU - Vardi, Adi
N1 - Funding Information:
Supported in part by the Israel Science Foundation and by the Israeli Centers of Research Excellence (I-CORE) program (Center No. 4/11), NWO Vidi grant 639.022.211, and Polish NCN grant DEC-2013/09/B/ST6/01538.
PY - 2016
Y1 - 2016
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84962859023&partnerID=8YFLogxK
U2 - 10.1137/1.9781611974331.ch11
DO - 10.1137/1.9781611974331.ch11
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84962859023
T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
SP - 140
EP - 154
BT - 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016
A2 - Krauthgamer, Robert
PB - Association for Computing Machinery
T2 - 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016
Y2 - 10 January 2016 through 12 January 2016
ER -