Category: Cc (Networks, routing & scheduling)

Title Cat:App Page
Fulfillment scheduling for buy-online-pickup-in-store orders Cc:140 OR/MS / 64 / 3-4 / 207
Easy cases of deadlock detection in train scheduling Cc:250 OR/MS / 64 / 3-4 / 209
Urban consolidation center or peer-to-peer platform? The solution to urban last-mile delivery Cc:120 OR/MS / 63 / 5-6 / 375
Shopping activity at warehouse club stores and its competitive and network density implications Cc:130 OR/MS / 63 / 3-4 / 227
Provably high-quality solutions for the meal delivery routing problem Cc:220 OR/MS / 62 / 5-6 / 369
Effects of rescheduling on patient no-show behavior in outpatient clinics Cc:220 OR/MS / 62 / 5-6 / 373
Mobile hailing technology and taxi driving behaviors Cc:100 OR/MS / 62 / 3-4 / 193
Planning for overtime: The value of shift extensions in physician scheduling Cc:220 OR/MS / 62 / 3-4 / 199
No-wait scheduling for locks Cc:250 OR/MS / 62 / 3-4 / 203
Network revenue management with cancellations and no-shows Cc:110 OR/MS / 62 / 1-2 / 39
Online vehicle routing: The edge of optimization in large-sale applications Cc:250 OR/MS / 62 / 1-2 / 43
Vehicle routing and location routing with intermediate stops: A review Cc:250 OR/MS / 62 / 1-2 / 45
Crowdsourced delivery – A dynamic pickup and delivery problem with ad hoc drivers Cc:250 OR/MS / 62 / 1-2 / 49
The same-day delivery problem for online purchases Cc:250 OR/MS / 62 / 1-2 / 53
Routing and scheduling for a last-mile transportation system Cc:250 OR/MS / 62 / 1-2 / 55
Applying operations research to scheduling work cells in a manufacturing environment Cc:150 OR/MS / 61 / 3-4 / 213
Implementation of continuous flow in the cabinet process at the Schneider Electric Plant in Tlaxcala, Mexico Cc:150 OR/MS / 61 / 3-4 / 215
Station dispatching problem for a large terminal: A constraint programming approach Cc:250 OR/MS / 61 / 3-4 / 219
Waste collection in urban areas: A case study Cc:220 OR/MS / 61 / 1-2 / 51
Women’s college hospital uses operations research to create an ambulatory clinic schedule Cc:220 OR/MS / 61 / 1-2 / 55
A joint vehicle routing and speed optimization problem Cc:250 OR/MS / 61 / 1-2 / 59
Container dispatching and conflict-free yard crane routing in an automated container terminal Cc:250 OR/MS / 61 / 1-2 / 61
Emergency train scheduling on Chinese high-speed railways Cc:250 OR/MS / 61 / 1-2 / 65
Dynamic scheduling in a many-server, multiclass system: The role of customer impatience in large systems Cc:140 OR/MS / 60 / 5-6 / 375
Stochastic inventory routing for perishable products Cc:250 OR/MS / 60 / 3-4 / 219
When waiting to see a doctor is less irritating: Understanding patient preferences and choice behavior in appointment scheduling Cc:220 OR/MS / 60 / 1-2 / 65
Multi-priority online scheduling with cancellations Cc:100 OR/MS / 59 / 5-6 / 395
Inventory routing with pickups and deliveries Cc:120 OR/MS / 59 / 5-6 / 399
Forest harvest scheduling and endogenous road costs Cc:240 OR/MS / 59 / 5-6 / 403
Time-indexed formulations for the runway scheduling problem Cc:250 OR/MS / 59 / 5-6 / 405
Improving post-disaster road network accessibility by strengthening links against failures Cc:250 OR/MS / 59 / 5-6 / 409
Optimal routing for plug-in hybrid electric vehicles Cc:250 OR/MS / 59 / 5-6 / 413
Collaborative vehicle routing: A survey Cc:250 OR/MS / 59 / 5-6 / 417
Adoptive routing and recharging policies for electric vehicles Cc:250 OR/MS / 59 / 5-6 / 421
The vehicle routing problem with release and due dates Cc:000 OR/MS / 59 / 3-4 / 231
Scheduling position-dependent maintenance operations Cc:100 OR/MS / 59 / 3-4 / 233
Appointment scheduling and routing optimization of attended home delivery with random customer behavior Cc:120 OR/MS / 59 / 3-4 / 235
Organization of public safety networks: Spillovers, interoperability and participation Cc:220 OR/MS / 59 / 3-4 / 239
Integrated anesthesiologist and room scheduling for surgeries: Methodology and application Cc:220 OR/MS / 59 / 3-4 / 245
Non-elementary formulations for single vehicle routing problems with pickups and deliveries Cc:250 OR/MS / 59 / 3-4 / 249
Regenerator location problem in flexible optical networks Cc:000 OR/MS / 59 / 1-2 / 57
Node, edge, arc routing and turn penalties: Multiple problems – one neighborhood extension Cc:000 OR/MS / 59 / 1-2 / 61
Optimal network design with end-to-end service requirements Cc:100 OR/MS / 59 / 1-2 / 65
Network pricing of congestion-free networks: The elastic and linear demand case Cc:110 OR/MS / 59 / 1-2 / 69
An exact method for vehicle routing and truck driver scheduling problems Cc:250 OR/MS / 59 / 1-2 / 71
Branch and price and cut for split-delivery vehicle routing problem with time windows and linear weight-related cost Cc:250 OR/MS / 59 / 1-2 / 75
Truck scheduling in the postal service industry Cc:250 OR/MS / 59 / 1-2 / 79
The electric location routing problem with time windows and partial recharging Cc:250 OR/MS / 59 / 1-2 / 81
Customizable route planning in road networks Cc:250 OR/MS / 59 / 1-2 / 85
The vehicle routing problem with transhipment facilities Cc:250 OR/MS / 59 / 1-2 / 87
Edge coloring: A natural model for sports scheduling Cc:290 OR/MS / 58 / 5-6 / 503
Fairness and collaboration in network air traffic flow management: An optimization approach Cc:250 OR/MS / 58 / 4 / 337
Integrated aircraft routing, crew pairing and tail assignment: Branch-and-price with many pricing problems Cc:250 OR/MS / 58 / 4 / 341
Operations research transforms the scheduling of Chilean soccer leagues and South American world cup qualifiers Cc:290 OR/MS / 58 / 4 / 345
UPS optimizes delivery routes Cc:220 OR/MS / 58 / 3 / 211
Optimal solutions to a real-world integrated airline scheduling problem Cc:250 OR/MS / 58 / 3 / 215
Reliable hub network design: Formulation and solution techniques Cc:250 OR/MS / 58 / 3 / 219
Scheduling methods for efficient stamping operations at an automotive company Cc:150 OR/MS / 58 / 1-2 / 71
The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm Cc:000 OR/MS / 57 / 5-6 / 459
Interactive Excel-based Gantt chart schedule builder Cc:100 OR/MS / 57 / 5-6 / 461
Workforce management and scheduling under flexible demand Cc:130 OR/MS / 57 / 5-6 / 463
A two-phase iterative heuristic approach for the production routing problem Cc:150 OR/MS / 57 / 5-6 / 467
Optimal choice for appointment scheduling window under patient no-show behavior Cc:220 OR/MS / 57 / 5-6 / 471
Bayesian analysis of traffic flow on Interstate I-55: The LWR model Cc:250 OR/MS / 57 / 5-6 / 475
Optimal routing for electric vehicle service systems Cc:250 OR/MS / 57 / 5-6 / 479
The time window assignment vehicle routing problem Cc:250 OR/MS / 57 / 5-6 / 483
Complexity of routing problems with release dates Cc:100 OR/MS / 57 / 4 / 341
A real-time order acceptance and scheduling approach for permutation flow shop problems Cc:150 OR/MS / 57 / 4 / 345
Optimal advance scheduling Cc:000 OR/MS / 57 / 3 / 217
Staffing call centers with uncertain arrival rates and co-sourcing Cc:100 OR/MS / 57 / 3 / 221
Experience-based routing in call center environments Cc:120 OR/MS / 57 / 1-2 / 65
Optimizing network designs for the world’s largest broadband project Cc:220 OR/MS / 57 / 1-2 / 69
Hook turns as a solution to the right-turning traffic problem Cc:250 OR/MS / 57 / 1-2 / 73
Two exact algorithms for the traveling umpire problem Cc:000 OR/MS / 56 / 5-6 / 481
Delay management including capacities of stations Cc:100 OR/MS / 56 / 5-6 / 485
The vehicle routing problem with divisible deliveries and pickups Cc:120 OR/MS / 56 / 5-6 / 489
The dial-a-ride problem with split requests and profits Cc:220 OR/MS / 56 / 5-6 / 493
The maximum throughput on a golf course Cc:220 OR/MS / 56 / 5-6 / 497
Congestion behavior and tolls in a bottleneck model with stochastic capacity Cc:000 OR/MS / 56 / 4 / 347
Scheduling: Agreement graph vs. resource constraints Cc:100 OR/MS / 56 / 4 / 351