Category: Cc (Networks, routing & scheduling)

Title Cat:App Page
Vehicle scheduling and routing with drivers’ working hours Cc:250 OR/MS / 49 / 5-6 / 463
Reducing flight delays through better traffic management Cc:250 OR/MS / 49 / 5-6 / 465
Designing multimodal freight transport networks: A heuristic approach and applications Cc:250 OR/MS / 49 / 4 / 347
Geography, networks, and knowledge flow Cc:100 OR/MS / 49 / 1-2 / 61
Vehicle routing for urban snow plowing operations Cc:250 OR/MS / 49 / 1-2 / 65
Coca-Cola enterprises optimizes vehicle routes for efficient product delivery Cc:250 OR/MS / 49 / 1-2 / 69
A model, heuristic procedure and decision support system for solving the movie shoot scheduling problem Cc:290 OR/MS / 49 / 1-2 / 73
Selecting and adapting weekly work schedules with working time accounts: A case of a retail clothing chain Cc:290 OR/MS / 49 / 1-2 / 77
Telecommunication liberalization and economic development in European countries in transition, Darko Dvornik and Dubravko Sabolic Cc:120 OR/MS / 48 / 6 / 563
Quality of service measures of mobile ad-hoc wireless network using energy consumption mitigation with asynchronous inactivity periods Cc:210 OR/MS / 48 / 6 / 565
Scheduling aircraft landings using airlines’ preferences Cc:250 OR/MS / 48 / 6 / 567
Integrated airline fleeting and crew-pairing decisions Cc:130 OR/MS / 48 / 4-5 / 423
The sector design and assignment problem for snow disposal operations Cc:220 OR/MS / 48 / 4-5 / 427
Scheduling in an assembly-type production chain with batch transfer Cc:150 OR/MS / 48 / 3 / 287
Determining a common production cycle time for an economic lot scheduling problem with deteriorating items Cc:150 OR/MS / 48 / 2 / 161
Vehicle routing and staffing for sedan service Cc:250 OR/MS / 48 / 2 / 163
The pickup and delivery problem with time windows and transshipment Cc:250 OR/MS / 48 / 2 / 167
Primal method for determining the most likely route flows in large road networks Cc:250 OR/MS / 48 / 1 / 43
A branch-and-cut algorithm for the dial-a-ride problem Cc:250 OR/MS / 48 / 1 / 47
A tabu search algorithm for a routing and container loading problem Cc:250 OR/MS / 47 / 6 / 635
Scatter search and bionomic algorithms for the aircraft landing problem Cc:250 OR/MS / 47 / 6 / 639
The sum of linear and a linear fractional transportation problem with restricted and enhanced flow Cc:250 OR/MS / 47 / 6 / 641
Worst-case analysis for split delivery vehicle routing problems Cc:000 OR/MS / 47 / 5 / 535
Self-organization of surface transportation networks Cc:000 OR/MS / 47 / 5 / 539
Heuristic algorithms for visiting the customers in a rolling schedule environment Cc:120 OR/MS / 47 / 5 / 543
Vehicle routing concepts in the closed-loop container network of ARN – a case study Cc:250 OR/MS / 47 / 5 / 547
An ant colony system approach for variants of the traveling salesman problem with time windows Cc:000 OR/MS / 47 / 4 / 415
An OR/MS approach to managing Nanzan Gakuen (Nanzan Educational Complex): From the strategic to the daily operational level Cc:130 OR/MS / 47 / 4 / 417
How big is too big? Trading off the economics of scale of larger telecommunications network elements against the risk of larger outages Cc:110 OR/MS / 47 / 3 / 287
Simulation and performance evaluation of a public safety wireless network: Case study Cc:220 OR/MS / 47 / 3 / 291
Scalability of an ad hoc on-demand routing protocol in very large-scale mobile wireless networks Cc:250 OR/MS / 47 / 3 / 293
Solving real-life locomotive-scheduling problems Cc:250 OR/MS / 47 / 3 / 297
Telecommunications reform: Resolving performance problems in Indonesia Cc:210 OR/MS / 47 / 2 / 169
Andalucia assesses the investment needed to deploy a fiber-optic network Cc:110 OR/MS / 47 / 1 / 47
Routing for a just-in-time supply pickup and delivery system Cc:120 OR/MS / 47 / 1 / 49
Routing of platforms in a maritime surface surveillance operation Cc:250 OR/MS / 47 / 1 / 51
System-optimal routing of traffic flows with user constraints in networks with congestion Cc:120 OR/MS / 46 / 6 / 641
A single-machine bicriterion scheduling problem with setup times Cc:150 OR/MS / 46 / 6 / 643
Maximizing federal natural gas royalties Cc:240 OR/MS / 46 / 6 / 647
A Petri nets-based scheduling methodology for multipurpose batch plants Cc:150 OR/MS / 46 / 5 / 531
Optimum operation control for multiple machining projects under fixed production interval Cc:150 OR/MS / 46 / 5 / 535
Reinventing crew scheduling at Netherlands Railways Cc:220 OR/MS / 46 / 5 / 539
The single-node dynamic service scheduling and dispatching problem Cc:120 OR/MS / 46 / 3 / 293
Genetic local search for multi-objective flowshop scheduling problems Cc:000 OR/MS / 46 / 2 / 159
The selection and scheduling of telecommunications calls with time windows Cc:000 OR/MS / 46 / 2 / 161
Dispatching vehicles in a mega container terminal Cc:220 OR/MS / 46 / 2 / 165
Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice Cc:220 OR/MS / 46 / 2 / 169
Scheduling multiple parts in two-machine dual-gripper robot cells: Heuristic algorithm and performance guarantee Cc:150 OR/MS / 46 / 1 / 61
America West Airlines develops efficient boarding strategies Cc:210 OR/MS / 46 / 1 / 65
Implementing a production schedule at LKAB’s Kiruna Mine Cc:240 OR/MS / 46 / 1 / 67
Hub-spoke network choice under competition with an application to Western Europe Cc:120 OR/MS / 45 / 6 / 649
Heuristics for two-machine flow shop problems with earliness and tardiness penalties Cc:150 OR/MS / 45 / 4 / 397
General Motors optimizes its scheduling of cold-weather tests Cc:190 OR/MS / 45 / 4 / 399
Improving volunteer scheduling for the Edmonton Folk Festival Cc:220 OR/MS / 45 / 4 / 401
Ant colony system with communication strategies Cc:000 OR/MS / 45 / 3 / 283
The dynamic assignment problem Cc:110 OR/MS / 45 / 3 / 285
Heuristic method for a mixed capacitated are routing problem: A refuse collection application Cc:120 OR/MS / 45 / 3 / 287
Solving multi-objective production scheduling problems using metaheuristics Cc:150 OR/MS / 45 / 3 / 289
Dynamical networks for information processing Cc:160 OR/MS / 45 / 3 / 293
A crane scheduling method for port container terminals Cc:120 OR/MS / 45 / 2 / 149
Tabu search algorithms for water network optimization Cc:220 OR/MS / 45 / 2 / 153
Real-time multivehicle truckload pickup and delivery problems Cc:120 OR/MS / 45 / 1 / 47
UPS optimizes its air network Cc:120 OR/MS / 45 / 1 / 51
Computer-aided complexity classification of dial-a-ride problems Cc:250 OR/MS / 45 / 1 / 53
Ship routing and scheduling: Status and perspectives Cc:120 OR/MS / 44 / 6 / 645
A route-directed hybrid genetic approach for the vehicle routing problem with time windows Cc:120 OR/MS / 44 / 6 / 649
Fleet sizing and vehicle routing for container transportation in a static environment Cc:120 OR/MS / 44 / 5 / 525
Improving crew scheduling by incorporating key maintenance routing decisions Cc:130 OR/MS / 44 / 4 / 403
A stochastic optimal control approach to real-time, incident-responsive traffic signal control at isolated intersections Cc:200 OR/MS / 44 / 4 / 407
Traffic knowledge management policy Cc:120 OR/MS / 43 / 6 / 639
An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem Cc:150 OR/MS / 43 / 6 / 641
Flow management to optimize retail profits at theme parks Cc:210 OR/MS / 43 / 6 / 643
Planning and scheduling in the process industry Cc:100 OR/MS / 43 / 5 / 535
A network model for airline cabin crew scheduling Cc:130 OR/MS / 43 / 5 / 537
Advanced production scheduling for batch plants in process industries Cc:150 OR/MS / 43 / 5 / 539
Mobile data and transaction management Cc:250 OR/MS / 43 / 5 / 543
A survey of communication protocol testing Cc:000 OR/MS / 43 / 4 / 393
Solution of a min-max vehicle routing problem Cc:220 OR/MS / 43 / 4 / 395
The arc routing and scheduling problem with transshipment Cc:220 OR/MS / 43 / 4 / 397
The value of production schedule integration in supply chains Cc:100 OR/MS / 43 / 2 / 157