Special Issue "Novel Evolutionary Computation Approaches to Scheduling and Timetabling"


A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (1 May 2013)

Special Issue Editors

Guest Editor
Prof. Dr. Wolfgang Banzhaf

Department of Computer Science, Memorial University of Newfoundland, St. John's, NL, A1B 3X5, Canada
Website: http://web.cs.mun.ca/~banzhaf/
Fax: +1 709 864 2009
Guest Editor
Dr. Nelishia Pillay

Room F3, 1st Floor Science Block, School of Computer Science, Pietermaritzburg Campus, University of KwaZulu-Natal, South Africa
Website: http://saturn.cs.unp.ac.za/~nelishiap/
Fax: +27 33 2605648

Special Issue Information

Dear Colleagues,

Scheduling and Timetabling problems are complex combinatorial optimization problems of enormous practical and economic importance. This issue focuses on the application of novel evolutionary computation methods to solve scheduling and timetabling problems. Evolutionary Computation, a machine learning technique, is based on Darwin's theory of evolution and as such iteratively refines an initial population of potential solutions using the processes of evaluation, selection and regeneration in an attempt to find solutions to (complex) optimization problems. The use of Evolutionary Computation techniques to solve scheduling and timetabling problems is a growing field and EC heuristics have been successfully applied to various subdomains including educational timetabling, transportation scheduling, personnel scheduling, job shop scheduling and sports scheduling amongst others.

Given the high processing times typical of evolutionary computing techniques in solving these problems, parallel EC methods and implementations are a recent trend of great importance. Authors are invited to submit manuscripts reporting original research on the application of EC to scheduling and timetabling problems and its efficient implementation.

Professor Wolfgang Banzhaf
Dr. Nelishia Pillay
Guest Editors


Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. Papers will be published continuously (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are refereed through a peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed Open Access quarterly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 300 CHF (Swiss Francs). English correction and/or formatting fees of 250 CHF (Swiss Francs) will be charged in certain cases for those articles accepted for publication that require extensive additional formatting and/or English corrections.


  • evolutionary computation
  • genetic algorithms
  • genetic programming
  • parallel implementation of EC methods
  • university course timetabling
  • examination timetabling
  • school timetabling
  • transportation scheduling, e.g. railway scheduling, aircraft landing
  • medical scheduling, including nurse, doctor and patient scheduling
  • job shop scheduling
  • personnel scheduling
  • sports scheduling

Published Papers (3 papers)

Download All Papers
Sort by:
Display options:
Select articles Export citation of selected articles as:
Select/unselect all
Displaying article 1-3
p. 278-308
by ,  and
Algorithms 2013, 6(2), 278-308; doi:10.3390/a6020278
Received: 6 March 2013 / Revised: 4 April 2013 / Accepted: 12 April 2013 / Published: 21 May 2013
Show/Hide Abstract | Cited by 3 | PDF Full-text (495 KB) | HTML Full-text | XML Full-text
p. 245-277
by , , , ,  and
Algorithms 2013, 6(2), 245-277; doi:10.3390/a6020245
Received: 14 January 2013 / Revised: 20 March 2013 / Accepted: 8 April 2013 / Published: 22 April 2013
Show/Hide Abstract | Cited by 4 | PDF Full-text (1247 KB) | HTML Full-text | XML Full-text
abstract graphic
p. 227-244
by  and
Algorithms 2013, 6(2), 227-244; doi:10.3390/a6020227
Received: 19 February 2013 / Revised: 25 March 2013 / Accepted: 8 April 2013 / Published: 19 April 2013
Show/Hide Abstract | Cited by 5 | PDF Full-text (387 KB)
Select/unselect all
Displaying article 1-3
Select articles Export citation of selected articles as:

Planned Papers

The below list represents only planned manuscripts. Some of these manuscripts have not been received by the Editorial Office yet. Papers submitted to MDPI journals are subject to peer-review.

Last update: 27 May 2013

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert