Similar Search Results

Complexity of the two-stage no-wait assembly problem with setup and removal times separated

Strusevič, Vitalij Aleksandrovič; Zwaneveld, Carin M. - 1991

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

Application of graph search and genetic algorithms for the single machine scheduling problem with sequence-dependent setup times and quadratic penalty function of completion times

Kodaganallur, Viswanathan; Sen, Anup K.; Mitra, Subrata - 2011

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

Very large-scale neighborhoods with performance guarantees for minimizing makespan on parallel machines

Brueggemann, Tobias; Hurink, Johann L.; Vredeveld, Tjark; … - 2006

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

Preemptive scheduling of uniform machines subject to release dates

Labetoulle, J. (contributor) - 1979

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

Profit-oriented scheduling of resource-constrained projects with flexible capacity constraints

Schnabel, André; Kellenbrink, Carolin; Helber, Stefan - 2017

established approaches for the RCPSP that aim to minimize the makespan of the project for given static capacity constraints, we … its makespan increases and try to find a schedule with a profit-maximizing makespan. Like the RCPSP, the problem is NP …

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