skip to content
Practice and theory of automated timetabling V 5th international conference ; revised selected papers Preview this item
ClosePreview this item
Checking...

Practice and theory of automated timetabling V 5th international conference ; revised selected papers

Author: Edmund Burke; PATAT <5, 2004, Pittsburgh, Pa.>
Publisher: Berlin Heidelberg New York Springer 2005
Series: Lecture notes in computer science, Vol. 3616.
Edition/Format:   Book : Conference publication : EnglishView all editions and formats
Database:WorldCat
Summary:

Constitutes the refereed post-proceedings of the 5th International Conference on Practice and Theory of Automated Timetabling, PATAT 2004, held in Pittsburgh, PA, USA in August 2004. This title  Read more...

Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Kongress
Conference proceedings
Congresses
Material Type: Conference publication
Document Type: Book
All Authors / Contributors: Edmund Burke; PATAT <5, 2004, Pittsburgh, Pa.>
ISBN: 9783540307051 3540307052
OCLC Number: 181496679
Notes: Literaturangaben
Description: XII, 353 S. graph. Darst. 24 cm
Contents: General Issues.- Learning User Preferences in Distributed Calendar Scheduling.- Semantic Components for Timetabling.- An Open Interactive Timetabling Tool.- Distributed Choice Function Hyper-heuristics for Timetabling and Scheduling.- Transport Timetabling.- A Hybridised Integer Programming and Local Search Method for Robust Train Driver Schedules Planning.- Logistics Service Network Design for Time-Critical Delivery.- University Course Timetabling.- The University Course Timetabling Problem with a Three-Phase Approach.- Minimal Perturbation Problem in Course Timetabling.- Feature Selection in a Fuzzy Student Sectioning Algorithm.- A Column Generation Scheme for Faculty Timetabling.- School Timetabling.- Decomposition and Parallelization of Multi-resource Timetabling Problems.- Interactively Solving School Timetabling Problems Using Extensions of Constraint Programming.- A Tiling Algorithm for High School Timetabling.- Project Scheduling.- Lower Bounds for the Multi-skill Project Scheduling Problem with Hierarchical Levels of Skills.- Examination Timetabling.- A Novel Similarity Measure for Heuristic Selection in Examination Timetabling.- A Tabu Search Hyper-heuristic Approach to the Examination Timetabling Problem at the MARA University of Technology.- A Hybrid Multi-objective Evolutionary Algorithm for the Uncapacitated Exam Proximity Problem.- Examination Timetabling with Fuzzy Constraints.- Fuzzy Multiple Heuristic Orderings for Examination Timetabling.
Series Title: Lecture notes in computer science, Vol. 3616.
Responsibility: PATAT 2004, Pittsburgh, PA, USA, August 18 - 20, 2004. Edmund Burke ; Michael Trick (ed.)
More information:

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/181496679>
library:oclcnum"181496679"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/181496679>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:datePublished"2005"
schema:editor
schema:exampleOfWork<http://worldcat.org/entity/work/id/899650287>
schema:genre"Conference proceedings."
schema:genre"Conference proceedings"
schema:genre"Kongress"
schema:inLanguage"en"
schema:name"Practice and theory of automated timetabling V 5th international conference ; revised selected papers"
schema:publisher
schema:url
schema:workExample
umbel:isLike<http://d-nb.info/977011437>

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.