Similar Search Results

Making the most of fleets : a profit-maximizing multi-vehicle pickup and delivery selection problem

Qiu, Xiaoqiu; Feuerriegel, Stefan; Neumann, Dirk - In: European journal of operational research : EJOR 259 (2017) 1, pp. 155-168

Persistent link: https://www.econbiz.de/10011644897

Tactical crew planning in railways

Şahin, Güvenç; Yüceoğlu, Birol - In: Transportation Research Part E: Logistics and … 47 (2011) 6, pp. 1221-1243

Tactical crew capacity planning problem in railways involves finding the minimum number of crews in a region required to operate a predetermined set of train duties satisfying the strict day-off requirement for crew. For the single-region problem, we develop two solution approaches based on a...

Persistent link: https://www.econbiz.de/10011048974

Airline OR innovations soar during COVID-19 recovery

Garrow, Laurie A.; Lurkin, Virginie; Marla, Lavanya - In: Operations research forum 3 (2022) 1, pp. 1-20

Persistent link: https://www.econbiz.de/10013173155

A three-phase heuristic for the Fairness-Oriented Crew Rostering Problem

Breugem, Thomas; Schlechte, Thomas; Schulz, Christof; … - In: Computers & operations research : and their … 154 (2023), pp. 1-12

Persistent link: https://www.econbiz.de/10014307339

A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint

Lee, Ju-Yong; Kim, Yeong-Dae - In: Journal of the Operational Research Society : OR 66 (2015) 9, pp. 1542-1554

Persistent link: https://www.econbiz.de/10011417478

A branch-and-bound algorithm for the concave cost supply problem

Yenipazarli, Arda; Benson, Harold P.; Erenguc, Selcuk - In: International journal of production research 54 (2016) 13/14, pp. 3943-3961

Persistent link: https://www.econbiz.de/10011508452

Exact algorithms for single-machine scheduling with time windows and precedence constraints

Davari, Morteza; Demeulemeester, Erik; Leus, Roel; … - In: Journal of scheduling 19 (2016) 3, pp. 309-334

Persistent link: https://www.econbiz.de/10011509149

A branch-and-bound algorithm for the maximum capture problem with random utilities

Freire, Alexandre S.; Moreno, Eduardo; Yushimito, … - In: European journal of operational research : EJOR 252 (2016) 1, pp. 204-212

Persistent link: https://www.econbiz.de/10011449447

A branch-and-bound approach to the traveling salesman problem with a drone

Poikonen, Stefan; Golden, Bruce; Wasil, Edward A. - In: INFORMS journal on computing : JOC 31 (2019) 2, pp. 335-346

Persistent link: https://www.econbiz.de/10012036788

An empirical analysis of exact algorithms for the unbounded knapsack problem

Becker, Henrique; Buriol, Luciana S. - In: European journal of operational research : EJOR 277 (2019) 1, pp. 84-99

Persistent link: https://www.econbiz.de/10012014811

1
2
3
4
5
6
7
8
9
10
Next
Last