Most cited papers in Scheduling and Timetabling Solutions
What are the most cited papers in Scheduling and Timetabling Solutions?
The most cited paper in Scheduling and Timetabling Solutions is "The Hungarian method for the assignment problem" (Harold William Kuhn, 1955), with 13,017 citations. Next come "TSPLIB—A Traveling Salesman Problem Library" (2,638) and "Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art" (2,343).
Showing 50 of 100 papers. Every paper with more than 298 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | The Hungarian method for the assignment problem Harold William Kuhn · Naval Research Logistics Quarterly | Mar 1955 | 13,017 |
| 2 | TSPLIB—A Traveling Salesman Problem Library Gerhard Reinelt · INFORMS journal on computing | Nov 1991 | 2,638 |
| 3 | Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art Carlos A. Coello Coello · Computer Methods in Applied Mechanics and Engineering | 2002 | 2,343 |
| 4 | An Automatic Method for Solving Discrete Programming Problems A. H. Land, Alison G. Doig | 6 Nov 2009 | 2,014 |
| 5 | A Decision Method for Elementary Algebra and Geometry Alfred Tarski · Texts & monographs in symbolic computation/Texts and monographs in symbolic computation | 1998 | 1,689 |
| 6 | Resource-constrained project scheduling: Notation, classification, models, and methods Peter Brucker, Andreas Drexl, Rolf H. Möhring et al. · European Journal of Operational Research | 1999 | 1,506 |
| 7 | PSPLIB - A project scheduling problem library Rainer Kolisch, Arno Sprecher · European Journal of Operational Research | 1997 | 1,290 |
| 8 | Staff scheduling and rostering: A review of applications, methods and models Andreas T Ernst, H. Jiang, Mohan Krishnamoorthy et al. · European Journal of Operational Research | 23 Apr 2003 | 1,267 |
| 9 | Operating room planning and scheduling: A literature review Brecht Cardoen, Erik L. Demeulemeester, Jeroen Beliën · European Journal of Operational Research | 25 Apr 2009 | 1,198 |
| 10 | A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications Yudong Zhang, Shuihua Wang, Genlin Ji · Mathematical Problems in Engineering | 2015 | 1,167 |
| 11 | Parallel Problem Solving from Nature - PPSN VIII GroÃ, Roderich, Dorigo, Marco · Lecture notes in computer science | 2004 | 1,151 |
| 12 | Tabu Search: A Tutorial Fred Glover · INFORMS Journal on Applied Analytics | Aug 1990 | 1,096 |
| 13 | Heuristics made easy: An effort-reduction framework. Anuj Shah, Daniel M. Oppenheimer · Psychological Bulletin | 2008 | 1,049 |
| 14 | The State of the Art of Nurse Rostering Edmund K. Burke, Patrick De Causmaecker, Greet Vanden Berghe et al. · Journal of Scheduling | 28 Oct 2004 | 950 |
| 15 | A user's guide to tabu search Fred Glover, Éric D. Taillard, Éric D. Taillard · Annals of Operations Research | Mar 1993 | 913 |
| 16 | A survey of variants and extensions of the resource-constrained project scheduling problem Sönke Hartmann, Dirk Briskorn · European Journal of Operational Research | 12 Nov 2009 | 897 |
| 17 | Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning David S. Johnson, C. Aragon, Lyle A. McGeoch et al. · Operations Research | Jun 1991 | 853 |
| 18 | Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems Steven Minton, Mark Johnston, Andrew B. Philips et al. · Artificial Intelligence | Dec 1992 | 840 |
| 19 | Personnel scheduling: A literature review Jorne Van den Bergh, Jeroen Beliën, Philippe De Bruecker et al. · European Journal of Operational Research | 26 Nov 2012 | 808 |
| 20 | Simulated annealing: A tool for operational research Richard W Eglese · European Journal of Operational Research | Jun 1990 | 807 |
| 21 | The directed subgraph homeomorphism problem Steven Fortune, John E. Hopcroft, James Wyllie · Theoretical Computer Science | Feb 1980 | 761 |
| 22 | Experimental investigation of heuristics for resource-constrained project scheduling: An update Rainer Kolisch, Sönke Hartmann · European Journal of Operational Research | 24 May 2005 | 750 |
| 23 | Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation Rainer Kolisch · European Journal of Operational Research | Apr 1996 | 704 |
| 24 | Hyper-Heuristics: An Emerging Direction in Modern Search Technology Edmund K. Burke, Graham Kendall, Jim Newall et al. · Kluwer Academic Publishers eBooks | 2 Feb 2006 | 668 |
| 25 | Using tabu search techniques for graph coloring Alain Hertz, D. de Werra · Computing | Dec 1987 | 664 |
| 26 | An introduction to timetabling D. de Werra · European Journal of Operational Research | Feb 1985 | 580 |
| 27 | A Classification of Hyper-heuristic Approaches Edmund K. Burke, Matthew Hyde, Graham Kendall et al. · International series in management science/operations research/International series in operations research & management science | 2010 | 567 |
| 28 | ISIS—a knowledge‐based system for factory scheduling Mark S. Fox, Stephen F. Smith · Expert Systems | Jul 1984 | 550 |
| 29 | Bat algorithm for constrained optimization tasks Amir H. Gandomi, Xin‐She Yang, Amir H. Alavi et al. · Neural Computing and Applications | 19 Jul 2012 | 547 |
| 30 | Smallest-last ordering and clustering and graph coloring algorithms David W. Matula, Leland L. Beck · Journal of the ACM | Jul 1983 | 545 |
| 31 | Solving Airline Crew Scheduling Problems by Branch-and-Cut Karla Hoffman, Manfred W. Padberg · Management Science | Jun 1993 | 540 |
| 32 | A competitive genetic algorithm for resource-constrained project scheduling Sönke Hartmann · Naval Research Logistics (NRL) | Oct 1998 | 530 |
| 33 | Assignment problems: A golden anniversary survey David W. Pentico · European Journal of Operational Research | 19 Nov 2005 | 519 |
| 34 | A Tabu-Search Hyperheuristic for Timetabling and Rostering Edmund K. Burke, Graham Kendall, Eric Soubeiga · Journal of Heuristics | Dec 2003 | 512 |
| 35 | A graph-based hyper-heuristic for educational timetabling problems Edmund K. Burke, Barry McCollum, Amnon Meisels et al. · European Journal of Operational Research | 22 Nov 2005 | 507 |
| 36 | Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem Sönke Hartmann, Rainer Kolisch · European Journal of Operational Research | Dec 2000 | 504 |
| 37 | Ants can colour graphs Davide Costa, Alain Hertz · Journal of the Operational Research Society | Mar 1997 | 501 |
| 38 | Nurse rostering problems––a bibliographic survey Brenda Cheang, Heng Li, Andrew E. B. Lim et al. · European Journal of Operational Research | 7 Apr 2003 | 500 |
| 39 | A graph coloring algorithm for large scheduling problems Frank Thomson Leighton · Journal of Research of the National Bureau of Standards | Nov 1979 | 494 |
| 40 | Hybrid Evolutionary Algorithms for Graph Coloring Philippe Galinier, Jin‐Kao Hao · Journal of Combinatorial Optimization | Dec 1999 | 480 |
| 41 | An integrated survey of deterministic project scheduling Rainer Kolisch, Rema Padman · Omega | Jun 2001 | 479 |
| 42 | A Hyperheuristic Approach to Scheduling a Sales Summit Peter Cowling, Graham Kendall, Eric Soubeiga · Lecture notes in computer science | 2001 | 478 |
| 43 | Home health care routing and scheduling: A review Christian Fikar, Patrick Hirsch · Computers & Operations Research | 23 Jul 2016 | 467 |
| 44 | Network-Based Heuristics for Constraint-Satisfaction Problems Rina Dechter, Judea Pearl | 1988 | 460 |
| 45 | An Annotated Bibliography of Personnel Scheduling and Rostering Andreas T Ernst, H. Jiang, Mohan Krishnamoorthy et al. · Annals of Operations Research | Mar 2004 | 460 |
| 46 | Algorithm portfolios Carla Pedro Gomes, Bart Selman · Artificial Intelligence | Feb 2001 | 450 |
| 47 | Scheduling Aircraft Landings—The Static Case J. E. Beasley, Mohan Krishnamoorthy, Yazid M. Sharaiha et al. · Transportation Science | May 2000 | 450 |
| 48 | Predicting job performance: Not much more than g.. Malcolm James Ree, James A. Earles, Mark S. Teachout · Journal of Applied Psychology | Aug 1994 | 448 |
| 49 | On the complexity of time table and multi-commodity flow problems Shimon Even, Alon Itai, Adi Shamir | Oct 1975 | 437 |
| 50 | Algorithms for the Set Covering Problem Alberto Caprara, Paolo Toth, Matteo Fischetti · Annals of Operations Research | Dec 2000 | 436 |
Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for a field when OpenAlex files it under one of the field's topics; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.