scientific article
From MaRDI portal
Publication:3585709
zbMath1198.68106MaRDI QIDQ3585709
Publication date: 23 August 2010
Full work available at URL: http://duepublico.uni-duisburg-essen.de/go/duett-04242003-131618
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (3)
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 ⋮ Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
This page was built for publication:
