A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Filters
Balanced sequences and optimal routing
2000
Journal of the ACM
Preserved Fulltext
We show under rather general assumptions that the optimal deterministic routing in stochastic event graphs is such a sequence. ...
The second objective of the paper is to relate this construction to the framework of optimal routing in queueing networks. ...
Acknowledgment The authors would like to thank Alain Jean-Marie who pointed out the reference 23] and gave them a rst proof of Lemma 2.12. ...
doi:10.1145/347476.347482
fatcat:hvh255cb7nejrlw6y5okl2u5uu
Scheduling with alternative routings in CNC workshops
2012
CIRP annals
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The proposed method combines mathematical programming for selecting the best routing alternatives and tabu search for finding the best assignment of machines to operations along with the routings. ...
Experiments in an industrial case study refer to the primary role of optimized load balancing that proved to be computationally tractable on large-scale problem instances. ...
Resource assignment and sequencing by tabu search The load balancing phase returns a routing and a machine assignment for each job. ...
doi:10.1016/j.cirp.2012.03.045
fatcat:c7sonzzy5fcurovmdkj6pcicou
Distributed load balancing in a multiple server system by shift-invariant protocol sequences
2013
2013 IEEE Wireless Communications and Networking Conference (WCNC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Numerical studies were carried out to compare our strategy with other routing strategies such as probabilistic routing and random sequences routing. ...
In this paper, we propose a new routing strategy based on the idea of shift-invariant protocol sequences. ...
Three routing strategies are compared in our simulation: probabilistic routing, random sequence routing and shift invariant sequence routing. ...
doi:10.1109/wcnc.2013.6554809
dblp:conf/wcnc/ZhangW13
fatcat:f3wwtj4t4ng4ncr2aiwecthoze
Exploring the Scope of Unconstrained Via Minimization by Recursive Floorplan Bipartitioning
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
routing layers, for a balanced trade-off between routability, wirelength and congestion. ...
The area/number balanced floorplan bipartitionining is a multi-objective optimization problem and known to be NP-hard majum2. ...
Intuitively, different (γ , β) pairs may potentially yield different optimal solution(s) and even a different sequence. ...
arXiv:1811.05161v1
fatcat:och2pxj3bbck7hl43r6x3pjmbe
Congestion–distortion optimized video transmission over ad hoc networks
2005
Signal processing. Image communication
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For this purpose, optimal routing algorithms which seek to minimize congestion by optimally distributing traffic over multiple paths are attractive. ...
The validity of the model is confirmed by network simulations performed with different routing algorithms, latency requirements and encoding structures. ...
The authors would like to thank Professors Andrea Goldsmith and Fouad Tobagi at Stanford University for many insightful discussions. This work is supported, in part, by NSF Grant CCR0325639. ...
doi:10.1016/j.image.2005.05.005
fatcat:5cyz6mpp7jaf5cysr5nptt6mda
An LP-based approach for loading and routing in a flexible assembly line
2000
International Journal of Production Economics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The problem objective is to simultaneously determine an allocation of assembly tasks among the stations and select assembly sequences and assembly routes for a mix of products so as to balance station ...
In the approach proposed, "rst the station workloads are balanced using a linear relaxation-based heuristic and then assembly sequences and assembly routes are selected for all products, based on a network ...
#exible #ow line, decreases the chances of getting optimal or good workload balance. ...
doi:10.1016/s0925-5273(99)00043-2
fatcat:wnm3lxhmffawrg5ynfzykaelui
Sequential Dynamic Strategies for Real-Time Scheduling of Terminal Traffic
2012
Journal of Aircraft
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
By contrast, the open-route algorithm allows route changes and produces optimal route assignments in addition to optimal flight sequences and STAs. ...
The fix-route algorithm computes the optimal flight sequences and STAs for all flights along their default routes. ...
doi:10.2514/1.c031503
fatcat:mnvljvgd45helajhjtm6u3bj3y
Intelligence heuristics to solve a Balanced Routing Problem in Supply Chain
2017
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Balanced routing of goods among supply chain entities will improve the asset utilization and customer service level in a supply chain system. ...
We develop a decision support system based on three-stage heuristics to solve this balanced routing problem. A case study is illustrated and the DSS is validated for this case study. ...
The algorithm for SA is given below and the results (Table 5 ) obtained in this stage of the heuristic is given in Fig. 7
Balancing the Route using SA The optimized route obtained from the route ...
doi:10.5120/ijca2017915518
fatcat:go6sbjjysngb5k7qr6x67qrt4a
Enhanced domain disjoint backward recursive TE path computation for PCE-based multi-domain networks
2010
Photonic network communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Both procedures make a good trade-off between the control overhead introduced and the accuracy of the computed end-to-end route. ...
The ability of computing optimal routes poses new challenges when extending it to larger multi-domain network scenarios, as the quality of these computed endto-end inter-domain routes depends on the selection ...
Acknowledgment The work reported in this paper has been partially supported by the UPC through a FPI-UPC research scholarship grant and the Spanish Science Ministry through Project "Engineering Next Generation ...
doi:10.1007/s11107-010-0288-5
fatcat:culfdw2p7jbapibftwbg25ki3q
Page 5015 of Mathematical Reviews Vol. , Issue 95h
[page]
1995
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
queueing network: optimal policies and heuristics. ...
These results are applied to the problem of finding a feasible production schedule over a finite planning pe- riod, and two methods, utilization of the balanced lot size and
application of the balance ...
Simulation and Optimization in Production Logistics Based on eM-Plant Platform
[chapter]
2011
IFIP Advances in Information and Communication Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The optimization of production logistics system is an important way to improve enterprise's productivity, cut down cost and improve equipment's utilization. ...
, production capacity statistics effectively, which can offer useful guideline for production logistics system optimization and scientific decision-making. ...
The assembly process route after adjustment is shown in Table 2 . And the assembly sequence after Optimized is shown in Fig.4. Fig. 4 . ...
doi:10.1007/978-3-642-18369-0_58
fatcat:vs4owfcw4jgmbpapd2sxlzofpe
Awareness in Congestion for Multipath Load Balancing in MANET
2013
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The simulation results illustrate that the proposed load balanced routing protocol improves packet delivery ratio and reduces the delay. ...
In this protocol, a weight function based on route length, traffic load, energy level and freshness of each route is calculated and stored in the route cache. ...
Optimal Route Discovery Optimal Route Discovery: The purpose of an Optimal Route discovery from multiple paths is to reduce the traffic load on any single path and prevent broadcast storm problem associated ...
doi:10.5120/11540-6799
fatcat:bxetzm4cnffpzdun5jzz47y2qu
Optimal Duty Cycling with Sleep-wake Schedule between Paired Nodes and Flexible Routing across Pairs
2016
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
as clustering, routing, duty cycling and many others. ...
In this paper, the adaptive optimal pairing with flexible routing has been utilized for the purpose of duty cycling in the sensor nodes. ...
The adaptive load balance equalization rainbow protocol can use this new metric route to realize the shortest route with balanced energy and better information measure. ...
doi:10.5120/ijca2016910419
fatcat:r25gi4dr75ecpoydjtb7uwjywm
Travel time control of destination coded vehicles in baggage handling systems
2008
2008 IEEE International Conference on Control Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The proposed control methods are optimal control and model predictive control. This way the optimal route and the optimal speed profile of each vehicle are determined. ...
of buffer overflows, and minimization of the transportation costs. ...
ACKNOWLEDGMENT Research supported by the STW-VIDI project "Multi-Agent Control of Large-Scale Hybrid Systems", by the BSIK project "Next Generation Infrastructures" (NGI), by the Transport Research Centre Delft, and ...
doi:10.1109/cca.2008.4629618
dblp:conf/IEEEcca/TarauSH08
fatcat:klqjphknfne6fi4hkwernduxjm
Randomized Partially-Minimal Routing: Near-Optimal Oblivious Routing for 3-D Mesh Networks
2012
IEEE Transactions on Very Large Scale Integration (vlsi) Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
RPM provably achieves optimal worst-case throughput for 3-D meshes when the network radix is even and within a factor of of optimal worst-case throughput when is odd. ...
Additionally, a variant of RPM called randomized minimal first (RMF) routing is proposed, which leverages the inherent load-balancing properties of the network traffic to further reduce packet latency ...
RMF ROUTING RPM achieves near-optimal worst-case throughput in 3-D mesh networks by load-balancing packets uniformly across all vertical layers and routing minimally on the horizontal layers. ...
doi:10.1109/tvlsi.2011.2167361
fatcat:64pom6acq5e2vih4nvns6picii
« Previous
Showing results 1 — 15 out of 133,019 results