See this document in CiteSeerX!

Stochastic Local Search for Multiprocessor Scheduling for Minimum Total Tardiness  (Make Corrections)  
Michael Pavlin, Holger H. Hoos, Thomas Stützle



  Home/Search   Context   Related

 
View or download:
cs.ubc.ca/spider/hoos...PavHooStu03.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cs.ubc.ca/spider/hoos/publai (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The multi-processor total tardiness problem (MPTTP) is an NP-hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a number of processors. Exact algorithms like branch and bound have proven to be impractical for the MPTTP, leaving stochastic local search (SLS) algorithms as the main alternative to find high-quality schedules. Among the available... (Update)

Active bibliography (related documents):   More   All
0.8:   Scheduling a single machine with sequence dependent setup.. - Gagné, Price, al.   (Correct)
0.5:   Variable Neighborhood Search - Hansen, Mladenovic (1997)   (Correct)
0.3:   Local Search for the Colouring Graph Problem. A.. - Chiarandini..   (Correct)

Similar documents based on text:   More   All
0.6:   Local Search Algorithms for SAT: An Empirical Evaluation - Hoos, Stützle (1999)   (Correct)
0.6:   Towards a Characterisation of the Behaviour of Stochastic.. - Hoos, Stützle (1999)   (Correct)
0.6:   Iterated Robust Tabu Search for MAX-SAT - Smyth, Hoos, Stützle (2003)   (Correct)

BibTeX entry:   (Update)

@misc{ pavlin-stochastic,
  author = "Michael Pavlin and Holger H. Hoos and Thomas St{\"u}tzle",
  title = "Stochastic Local Search for Multiprocessor Scheduling for Minimum Total
    Tardiness",
  url = "citeseer.ist.psu.edu/569440.html" }
Citations (may not include all citations):
353   An Introduction to Genetic Algorithms (context) - Mitchell - 1996
169   Evolutionary Algorithms in Theory and Practice (context) - Back - 1996
51   genetic algorithms and martial arts: Towards memetic algorit.. (context) - Moscato - 1989
36   Memetic algorithms: A short introduction (context) - Moscato - 1999
22   Minimizing total tardiness on one machine is NP-hard (context) - Du, Leung - 1990
20   Local Search Algorithms for Combinatorial Problems -- Analys.. (context) - Stutzle - 1998
14   An iterated dynasearch algorithm for the single--machine tot.. (context) - Congram, Potts et al. - 2002
14   Iterated local search (context) - Lourenco, Martin et al. - 2002
7   One-machine sequencing to minimize certain functions of job .. (context) - Emmons - 1969
7   Improved large-step Markov chain variants for the symmetric .. - Hong, Kahng et al. - 1997
6   A new decomposition approach for the single machine total ta.. (context) - Croce, Tadei et al. - 1998
5   The total tardiness problem: Review and extensions (context) - Koulamas - 1994
4   Computers and Intractability: A Guide to the Theory of ##- C.. (context) - Garey, Johnson - 1979
3   A tabu search heuristic for the multiprocessor scheduling pr.. (context) - Frana, Gendreau et al. - 1996
2   Variable neighborhood search for multiprocessor scheduling w.. - Davidovic, Hansen et al. - 2001
1   Configuration of iterated local search: An example applicati.. (context) - den Besten, Stutzle et al. - 2001
1   Heuristics and metaheuristics for a parallel machine schedul.. - Sevaux, Thomin - 2001
1   Analysing the run-time behaviour of iterated local search fo.. (context) - Stutzle, Hoos - 2001
1   Tardiness minimization on parallel machines (context) - Azizoglu, Kirca - 1998
1   A memetic algorithm for the total tardiness total tardiness .. (context) - Frana, Mendes et al. - 2001
1   Ants for the single machine total weighted tardiness schedul.. (context) - den Besten - 2000
1   Sabuncuoglu: Single machine total tardiness scheduling probl.. (context) - Tansel, Kara - 2001
1   Parallel machine scheduling with earliness and tardiness pen.. (context) - Sivrikaya-Serifoglu, Ulusoy - 1999
1   SMTTP problem library (context) - Kara - 2002

Documents on the same site (http://www.cs.ubc.ca/spider/hoos/publ-ai.html):   More
Improving the Ant System: A Detailed Report on the MAX-MIN Ant .. - Stützle, Hoos (1996)   (Correct)
Improvements on the Ant-System: Introducing the MAX-MIN.. - Thomas Stützle, Holger.. (1997)   (Correct)
Solving Hard Combinatorial Problems with GSAT - a Case Study - Hoos (1996)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC