Most cited papers in Scheduling and Optimization Algorithms
What are the most cited papers in Scheduling and Optimization Algorithms?
The most cited paper in Scheduling and Optimization Algorithms is "Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment" (C. L. Liu, J. W. Layland, 1973), with 8,426 citations. Next come "Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey" (5,863) and "The Truck Dispatching Problem" (4,980).
Showing 50 of 99 papers. Every paper with more than 802 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment C. L. Liu, J. W. Layland · Journal of the ACM | 1973 | 8,426 |
| 2 | Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey Ronald Graham, Eugene L. Lawler, Jan Karel Lenstra et al. · Annals of discrete mathematics | 1979 | 5,863 |
| 3 | The Truck Dispatching Problem George B. Dantzig, J. H. Ramser · Management Science | Oct 1959 | 4,980 |
| 4 | Industry 4.0 Heiner Lasi, Peter Fettke, Hans-Georg Kemper et al. · Business & Information Systems Engineering | 19 Jun 2014 | 4,243 |
| 5 | Optimal two‐ and three‐stage production schedules with setup times included S. M. Johnson · Naval Research Logistics Quarterly | Mar 1954 | 3,269 |
| 6 | Chaff Matthew W. Moskewicz, Conor F. Madigan, Ying Jie Zhao et al. | 2001 | 2,938 |
| 7 | Ant Algorithms for Discrete Optimization Marco Dorigo, Gianni A. Di, Luca Maria Gambardella · Artificial Life | Apr 1999 | 2,823 |
| 8 | The Complexity of Flowshop and Jobshop Scheduling Michael R. Garey, David Johnson, Ravi Sethi · Mathematics of Operations Research | May 1976 | 2,644 |
| 9 | A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem Muhammad Nawaz, E. Emory Enscore, Inyong Ham · Omega | 1983 | 2,537 |
| 10 | Benchmarks for basic scheduling problems Éric D. Taillard · European Journal of Operational Research | 1993 | 2,484 |
| 11 | Ant colony optimization theory: A survey Marco Dorigo, Christian Blum · Theoretical Computer Science | 3 Aug 2005 | 2,314 |
| 12 | Theory of Linear and Integer Programming. David Keith Smith, Alexander Schrijver · Journal of the Operational Research Society | Jun 1987 | 2,292 |
| 13 | Condor-a hunter of idle workstations Michael Litzkow, Miron Livny, Matt W. Mutka | 6 Jan 2003 | 2,264 |
| 14 | Complexity of Machine Scheduling Problems Jan Karel Lenstra, A. H. G. Rinnooy Kan, Peter Brucker · Annals of discrete mathematics | 1977 | 2,204 |
| 15 | Ant colony optimization: a new meta-heuristic Marco Dorigo, Gianni A. Di | 20 Jan 2003 | 2,147 |
| 16 | Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems R. Venkata Rao · International Journal of Industrial Engineering Computations | 24 Aug 2015 | 2,078 |
| 17 | A Linear Programming Approach to the Cutting-Stock Problem Paul C. Gilmore, Ralph E. Gomory · Operations Research | Dec 1961 | 2,030 |
| 18 | Reconfigurable Manufacturing Systems Yoram Koren, Uwe Heisel, F. Jovane et al. · CIRP Annals | 1999 | 2,023 |
| 19 | An Automatic Method for Solving Discrete Programming Problems A. H. Land, Alison G. Doig | 6 Nov 2009 | 2,014 |
| 20 | Various optimizers for single‐stage production Wayne E. Smith · Naval Research Logistics Quarterly | Mar 1956 | 1,839 |
| 21 | Supply chain design and analysis: Benita M. Beamon · International Journal of Production Economics | Aug 1998 | 1,837 |
| 22 | Optimization by simulated annealing: Quantitative studies Scott Kirkpatrick · Journal of Statistical Physics | Mar 1984 | 1,818 |
| 23 | Nonlinear Programming--Sequential Unconstrained Minimization Techniques M. J. D. Powell · The Computer Journal | Aug 1969 | 1,753 |
| 24 | A Formal Analysis and Taxonomy of Task Allocation in Multi-Robot Systems Brian P. Gerkey, Maja J. Matarić · The International Journal of Robotics Research | Sep 2004 | 1,745 |
| 25 | The Shifting Bottleneck Procedure for Job Shop Scheduling Joseph Adams, Egon Balas, Daniel Joseph Zawack · Management Science | Mar 1988 | 1,611 |
| 26 | Genetic Algorithms and Random Keys for Sequencing and Optimization James C. Bean · INFORMS journal on computing | May 1994 | 1,520 |
| 27 | 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 |
| 28 | Machine learning for combinatorial optimization: A methodological tour d'horizon Yoshua Bengio, Andrea Lodi, Antoine Prouvost · Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna) | 2021 | 1,453 |
| 29 | NP-complete scheduling problems Jeffrey David Ullman · Journal of Computer and System Sciences | Jun 1975 | 1,453 |
| 30 | Scheduling subject to resource constraints: classification and complexity Jacek Błażewicz, Jan Karel Lenstra, A. H. G. Rinnooy Kan · Discrete Applied Mathematics | 1983 | 1,430 |
| 31 | Ant colony optimization for continuous domains Krzysztof Socha, Marco Dorigo · European Journal of Operational Research | 4 Nov 2006 | 1,416 |
| 32 | Towards smart factory for industry 4.0: a self-organized multi-agent system with big data based feedback and coordination Shiyong Wang, Jiafu Wan, Daqiang Zhang et al. · Computer Networks | 5 Jan 2016 | 1,412 |
| 33 | Reference architecture for holonic manufacturing systems: PROSA Hendrik Van Brussel, Jo Wyns, Paul Valckenaers et al. · Computers in Industry | Nov 1998 | 1,411 |
| 34 | Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems Derviş Karaboğa, Bahriye Basturk · Lecture notes in computer science | 30 Jun 2007 | 1,408 |
| 35 | The pinch design method for heat exchanger networks Bodo Linnhoff, E. Hindmarsh · Chemical Engineering Science | 1983 | 1,375 |
| 36 | HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS Fred Glover · Decision Sciences | 1977 | 1,363 |
| 37 | A survey of scheduling problems with setup times or costs Ali Allahverdi, Chi To Ng, T.C.E. Cheng et al. · European Journal of Operational Research | 21 Nov 2006 | 1,356 |
| 38 | Complexity of vehicle routing and scheduling problems Jan Karel Lenstra, A. H. G. Rinnooy Kan · Networks | Jun 1981 | 1,324 |
| 39 | Revolutionizing Supply Chain Management: Real-time Data Processing and Concurrency Suwarna Shukla, Prabhneet Singh · International Journal of Innovative Science and Research Technology (IJISRT) | 11 May 2024 | 1,322 |
| 40 | Routing and scheduling in a flexible job shop by tabu search Paolo Brandimarte · Annals of Operations Research | Sep 1993 | 1,317 |
| 41 | Resource Management with Deep Reinforcement Learning Hongzi Mao, Mohammad Reza Alizadeh, Ishai Menache et al. | 2 Nov 2016 | 1,314 |
| 42 | A Survey of Scheduling Rules Shrikant S. Panwalkar, Wafik H. Iskander · Operations Research | Feb 1977 | 1,301 |
| 43 | PSPLIB - A project scheduling problem library Rainer Kolisch, Arno Sprecher · European Journal of Operational Research | 1997 | 1,290 |
| 44 | 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 |
| 45 | Economic Order Quantity under Conditions of Permissible Delay in Payments S.K. Goyal · Journal of the Operational Research Society | Apr 1985 | 1,217 |
| 46 | Cyber-physical Production Systems: Roots, Expectations and R&D Challenges László Monostori · Procedia CIRP | 2014 | 1,198 |
| 47 | Optimality and non-scalar-valued performance criteria L. Zadeh · IEEE Transactions on Automatic Control | 1963 | 1,179 |
| 48 | A general algorithm for short-term scheduling of batch operations—I. MILP formulation Emilia M. Kondili, Constantinos C. Pantelides, R.W.H. Sargent · Computers & Chemical Engineering | Feb 1993 | 1,162 |
| 49 | A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem Rubén Ruíz, Thomas Stützle · European Journal of Operational Research | 20 Jan 2006 | 1,136 |
| 50 | Job Shop Scheduling by Simulated Annealing Peter J. M. van Laarhoven, Emile Aarts, Jan Karel Lenstra · Operations Research | Feb 1992 | 1,130 |
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.