Publication:3585709
From MaRDI portal
zbMath1198.68106MaRDI QIDQ3585709
Publication date: 23 August 2010
Full work available at URL: http://duepublico.uni-duisburg-essen.de/go/duett-04242003-131618
68Q25: Analysis of algorithms and problem complexity
68W05: Nonnumerical algorithms
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68-02: Research exposition (monographs, survey articles) pertaining to computer science
Related Items
Complete local search with limited memory algorithm for no-wait job shops to minimize makespan, No-wait job shop scheduling: tabu search and complexity of subproblems, An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach