Milk-run routing and scheduling subject to different pick-up/delivery profiles and congestion-avoidance constraints

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Internet Congestion Control Subject to Node and Link Constraints

Abstract: This paper studies the mathematical modelling of Internet congestion control. Differently to previous models, which consider either the link capacity or the node processing capability as the constraints, here we take both of them into account, i.e., the aggregate flow rate on a link cannot exceed the link capacity and the aggregate flow rate at a node is limited by the node processing...

متن کامل

Vehicle Re - Routing Strategies for Congestion Avoidance

VEHICLE RE-ROUTING STRATEGIES FOR CONGESTION AVOIDANCE

متن کامل

Routing and Job-shop Scheduling in O(congestion

2)L 0 such packets. Thus, w.h.p. the number of packets that are actually scheduled to cross e during the frame is at most (1? 0)f(n), where 0 is a function of. The number of steps a packet takes during the frame is at most f(n)=g(n). Therefore, using the assumed algorithm, we can schedule all the path segments that fall into this frame so that each packet is delivered within (1 +)(1 ? 0)f(n) + ...

متن کامل

Packet Routing and Job - Shop Scheduling inO ( Congestion + Dilation )

In this paper, we prove that there exists a schedule for routing any set of packets with edge-simple paths, on any network, in O(c+d) steps, where c is the congestion of the paths in the network, and d is the length of the longest path. The result has applications to packet routing in parallel machines, network emulations, and job-shop scheduling.

متن کامل

Congestion Control, Routing and Scheduling in Communication Networks: A Tutorial

In communication networks, congestion control, routing, and multiple access schemes for scheduling transmissions are typically regulated by distributed algorithms. Engineers designed these algorithms using clever heuristics that they refined in the light of simulation results and experiments. Over the last two decades, a deeper understanding of these algorithms emerged through the work of resea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC-PapersOnLine

سال: 2019

ISSN: 2405-8963

DOI: 10.1016/j.ifacol.2019.08.089