scientific article
From MaRDI portal
Publication:2779816
zbMath0982.68746MaRDI QIDQ2779816
Publication date: 15 April 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2079/20790277
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Computing methodologies and applications (68U99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Project scheduling with finite or infinite number of activity processing modes -- a survey, Lower bounds for resource-constrained project scheduling problems., Towards constraint-based school timetabling, Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem, A survey of variants and extensions of the resource-constrained project scheduling problem, Activity list representation for a generalization of the resource-constrained project scheduling problem, Scheduling non-professional table-tennis leagues, A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints
