Category: Cc (Networks, routing & scheduling)

Categories: Cc (Networks, routing & scheduling)
Title Cat:App Page
A mobile agent-based active network architecture for intelligent network control Cc:100 OR/MS / 43 / 2 / 161
A heuristic search approach for a nonstationary stochastic shortest path problem with terminal cost Cc:100 OR/MS / 43 / 1 / 45
Assembly line scheduling with concurrent operations and parallel machines Cc:150 OR/MS / 43 / 1 / 47
Soft evidential update for probabilistic multiagent systems Cc:000 OR/MS / 42 / 6 / 637
Probing a traffic congestion controversy: Density and flow scrutinized Cc:250 OR/MS / 42 / 6 / 641
Vehicle dispatching system based on Taguchi-tuned fuzzy rules Cc:000 OR/MS / 42 / 5 / 523
Technology foresight in companies: From an indicator to a network and process perspective Cc:160 OR/MS / 42 / 5 / 527
The latest arrival hub location problem Cc:250 OR/MS / 42 / 5 / 531
Multicriteria hub decision making for rural area telecommunication networks Cc:250 OR/MS / 42 / 4 / 417
Strategic service network design for DHL Hong Kong Cc:100 OR/MS / 42 / 3 / 285
A multi-period network design problem for cellular telecommunication systems Cc:250 OR/MS / 42 / 3 / 289
Production scheduling theory: Just where is it applicable? Cc:150 OR/MS / 42 / 2 / 167
Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing Cc:150 OR/MS / 42 / 2 / 171
Sequencing of jobs in some production system Cc:150 OR/MS / 42 / 1 / 43
Workforce-constrained preventative maintenance scheduling using evolution strategies Cc:150 OR/MS / 42 / 1 / 45
Scheduling with fixed delivery dates Cc:150 OR/MS / 42 / 1 / 47
Identifying opportunities for improving Teradyne’s service-parts logistics system Cc:150 OR/MS / 41 / 6 / 637
Optimal scheduling of progressive processing tasks Cc:000 OR/MS / 41 / 5 / 535
Trapped in your own net? Network cohesion, structural holes and the adaptation of social capital Cc:130 OR/MS / 41 / 5 / 539
A characterization of logistic networks for product recovery Cc:240 OR/MS / 41 / 5 / 541
A Pareto improving strategy for the time-dependent morning commute problem Cc:000 OR/MS / 41 / 4 / 411
Measurement-based usage charges in communications networks Cc:110 OR/MS / 41 / 4 / 413
Coupling and control flow measures in practice Cc:100 OR/MS / 41 / 3 / 281
Time-indexed formulations for machine scheduling problems: Column generation Cc:150 OR/MS / 41 / 3 / 285
Scheduling to improve field service quality Cc:150 OR/MS / 41 / 1 / 53
Fault-tolerant wormhole routing in two-dimensional mesh networks with convex faults Cc:160 OR/MS / 41 / 1 / 57
Hybrid fiber co-axial CATV network design with variable capacity optical network units Cc:250 OR/MS / 41 / 1 / 59
A taxonomy of industries based on knowledge flow structure Cc:100 OR/MS / 40 / 6 / 639
Scheduling to improve field service quality Cc:150 OR/MS / 40 / 6 / 641
Multimodal express package delivery: A service network design application Cc:000 OR/MS / 40 / 5 / 523
Design of partially survivable networks for cellular telecommunication systems Cc:220 OR/MS / 40 / 3 / 273
Bounds and policies for dynamic routing in loss networks Cc:000 OR/MS / 40 / 2 / 165