The following pages link to PESPLib (Q38075):
Displayed 50 items.
- Line search method for solving a non-preemptive strictly periodic scheduling problem (Q310329) (← links)
- An experimental comparison of periodic timetabling models (Q336491) (← links)
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling (Q337170) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- Review of real-time vehicle schedule recovery methods in transportation services (Q490374) (← links)
- A short-turning policy for the management of demand disruptions in rapid transit systems (Q512986) (← links)
- Railway track allocation: Models and methods (Q657061) (← links)
- Cyclic multiple-robot scheduling with time-window constraints using a critical path approach (Q856208) (← links)
- Tabu search algorithms for cyclic machine scheduling problems (Q880506) (← links)
- Packing and partitioning orbitopes (Q925263) (← links)
- Cyclic scheduling for F.M.S.: Modelling and evolutionary solving approach (Q933521) (← links)
- A column generation approach to train timetabling on a corridor (Q941001) (← links)
- Integral cycle bases for cyclic timetabling (Q1013300) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
- Design of a railway scheduling model for dense services (Q1024087) (← links)
- Mathematical solutions for solving periodic railway transportation (Q1036453) (← links)
- Computing delay resistant railway timetables (Q1046699) (← links)
- Minimizing waiting times in integrated fixed interval timetables by upgrading railway tracks (Q1280194) (← links)
- The complexity of scheduling jobs in repetitive manufacturing systems (Q1310021) (← links)
- Study of a NP-hard cyclic scheduling problem: The recurrent job-shop (Q1319564) (← links)
- On the stabilization of resource usage for cyclical sequencing problems (Q1342429) (← links)
- Discrete optimization in public rail transport (Q1365068) (← links)
- Routing trains through a railway station based on a node packing model (Q1592731) (← links)
- Optimization of multiperiod mixed train schedule on high-speed railway (Q1723163) (← links)
- Integration of timetable planning and rolling stock in rapid transit networks (Q1761752) (← links)
- Sensitivity analysis of a railway station track layout with respect to a given timetable (Q1806663) (← links)
- A genetic algorithm approach to periodic railway synchronization (Q1915964) (← links)
- Periodic network optimization with different arc frequencies (Q1923597) (← links)
- Nominal and robust train timetabling problems (Q1926692) (← links)
- Multi-train trajectory optimization for energy-efficient timetabling (Q1991169) (← links)
- Bamboo garden trimming problem: priority schedulings (Q2003325) (← links)
- Railway timetabling with integrated passenger distribution (Q2076872) (← links)
- A survey of real-time scheduling on multiprocessor systems (Q2090220) (← links)
- How to minimize cycle times of robot manufacturing systems (Q2139147) (← links)
- An analysis of the parameterized complexity of periodic timetabling (Q2142676) (← links)
- An iterative heuristic for passenger-centric train timetabling with integrated adaption times (Q2147000) (← links)
- A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing (Q2242251) (← links)
- Adjusting a railway timetable in case of partial or complete blockades (Q2256323) (← links)
- Exact formulations and algorithm for the train timetabling problem with dynamic demand (Q2257347) (← links)
- Timetabling with passenger routing (Q2260893) (← links)
- Separation of cycle inequalities in periodic timetabling (Q2299981) (← links)
- Minimizing the waiting time for a one-way shuttle service (Q2305017) (← links)
- Simultaneous disruption recovery of a train timetable and crew roster in real time (Q2387256) (← links)
- Cost optimal periodic train scheduling (Q2433233) (← links)
- Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints (Q2467264) (← links)
- Generation of classes of robust periodic railway timetables (Q2489288) (← links)
- Efficient scheduling of periodic information monitoring requests (Q2496080) (← links)
- Global k-Level Crossing Reduction (Q2865048) (← links)
- (Q2917354) (← links)
- (Q2917357) (← links)