Similar Search Results

Computation

Sprecher, Arno; Drexl, Andreas - 1996

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

Solving the RCPSP efficiently at modest memory requirements

Sprecher, Arno - 1996

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

A mixed-integer programming-based heuristic for project scheduling with work-content constraints

Zimmermann, Adrian - In: European journal of industrial engineering : EJIE 11 (2017) 6, pp. 752-773

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

A project scheduling problem with spatial resource constraints and a corresponding guided local search algorithm

Hu, Shicheng; Zhang, Zhaoze; Wang, Song; Kao, Yonggui; … - In: Journal of the Operational Research Society 70 (2019) 8, pp. 1349-1361

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

Multi-mode resource-constrained project scheduling problem with material ordering under bonus-penalty policies

Zoraghi, Nima; Shahsavar, Aria; Abbasi, Babak; Van … - In: Top : transactions in operations research 25 (2017) 1, pp. 49-79

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

Solving the nuclear dismantling project scheduling problem by combining mixed-integer and constraint programming techniques and metaheuristics

Hübner, Felix; Gerhards, Patrick; Stürck, Christian; … - In: Journal of scheduling : JOS 24 (2021) 3, pp. 269-290

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

Multi-project scheduling : a benchmark analysis of metaheuristic algorithms on various optimisation criteria and due dates

Bredael, Dries; Vanhoucke, Mario - In: European journal of operational research : EJOR 308 (2023) 1, pp. 54-75

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

A network simplex method for the budget-constrained minimum cost flow problem

Holzhauser, Michael; Krumke, Sven O.; Thielen, Clemens - In: European journal of operational research : EJOR 259 (2017) 3, pp. 864-872

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

A strongly polynomial contraction-expansion algorithm for network flow problems

Gauthier, Jean Bertrand; Desrosiers, Jacques; … - In: Computers & operations research : and their … 84 (2017), pp. 16-32

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

Multi-objective optimization of discrete time-cost tradeoff problem in project networks using non-dominated sorting genetic algorithm

Shahriari, Mohammadreza - In: Journal of industrial engineering international 12 (2016), pp. 59-169

The time–cost tradeoff problem is one of the most important and applicable problems in project scheduling area. There are many factors that force the mangers to crash the time. This factor could be early utilization, early commissioning and operation, improving the project cash flow, avoiding...

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