The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
A research survey: review of flexible job shop scheduling techniques
Abstract
In the last 25 years, extensive research has been carried out addressing the flexible job shop scheduling (JSS) problem. A variety of techniques ranging from exact methods to hybrid techniques have been used in this research. The paper aims at presenting the development of flexible JSS and a consolidated survey of various techniques that have been employed since 1990 for problem resolution. The paper comprises evaluation of publications and research methods used in various research papers. Finally, conclusions are drawn based on performed survey results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
(1979) · Cited by 43,841
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067
AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION
Karaboğa, D. (2005) · Cited by 5,466
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
Future paths for integer programming and links to artificial intelligence
Glover, F. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90048-1 · Cited by 4,181
Optimization, Learning and Natural Algorithms
Dorigo, M. (1992) · Medical Entomology and Zoology · Cited by 3,307
Routing and scheduling in a flexible job shop by tabu search
Brandimarte, P. (1993) · Annals of Operations Research · doi:10.1007/bf02023073 · Cited by 1,322
The immune system, adaptation, and machine learning
Farmer, J. D., Packard, N. H., & Perelson, A. S. (1986) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(86)90240-x · Cited by 1,087
System Identification Parameter and State Estimation
Eykhoff, P. (1974) · Virtual Defense Library (Ministerio de Defensa) · Cited by 1,083
A probabilistic heuristic for a computationally difficult set covering problem
Feo, T. A., & Resende, M. G. C. (1989) · Operations Research Letters · doi:10.1016/0167-6377(89)90002-3 · Cited by 1,065
Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop
Rand, G. K., & French, S. D. (1982) · Journal of the Operational Research Society · doi:10.1057/jors.1982.184 · Cited by 1,047
A genetic algorithm for the Flexible Job-shop Scheduling Problem
Pezzella, F., Morganti, G., & Ciaschetti, G. (2008) · Computers & Operations Research · doi:10.1016/j.cor.2007.02.014 · Cited by 1,014
Kacem, I., Hammadi, S., & Borne, P. (2002) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2002.1009117 · Cited by 788
An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
Xia, W., & Wu, Z. (2005) · Computers & Industrial Engineering · doi:10.1016/j.cie.2005.01.018 · Cited by 681
Ant system for Job-shop Scheduling
Colorni, A., Dorigo, M., Maniezzo, V., & Trubian, M. (1994) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 617
Tabu search for the job-shop scheduling problem with multi-purpose machines
Hurink, J. L., Jurisch, B., & Thole, M. (1994) · OR Spectrum · doi:10.1007/bf01719451 · Cited by 599
Gao, J., Sun, L., & Gen, M. (2007) · Computers & Operations Research · doi:10.1016/j.cor.2007.01.001 · Cited by 539
Zhang, G., Shao, X., Li, P., & Gao, L. (2009) · Computers & Industrial Engineering · doi:10.1016/j.cie.2008.07.021 · Cited by 513
Tay, J. C., & Ho, N. B. (2008) · Computers & Industrial Engineering · doi:10.1016/j.cie.2007.08.008 · Cited by 471
Newton's Method for Multiobjective Optimization
Fliege, J., Drummond, L. M. G., & Svaiter, B. F. (2009) · SIAM Journal on Optimization · doi:10.1137/08071692x · Cited by 409
Filtered beam search in scheduling†
OW, P. S., & MORTON, T. E. (1988) · International Journal of Production Research · doi:10.1080/00207548808947840 · Cited by 393
An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem
De Giovanni, L., & Pezzella, F. (2010) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.01.008 · Cited by 345
Moslehi, G., & Mahnam, M. (2011) · International Journal of Production Economics · doi:10.1016/j.ijpe.2010.08.004 · Cited by 313
An artificial immune algorithm for the flexible job-shop scheduling problem
Bagheri, A., Zandieh, M., Mahdavi, I., & Yazdani, M. (2009) · Future Generation Computer Systems · doi:10.1016/j.future.2009.10.004 · Cited by 280
Li, J.-Q., Pan, Q.-K., & Tasgetiren, M. F. (2014) · Applied Mathematical Modelling · doi:10.1016/j.apm.2013.07.038 · Cited by 273
Multiobjective Flexible Job Shop Scheduling Using Memetic Algorithms
Yuan, Y., & Xu, H. (2015) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2013.2274517 · Cited by 270
Greedy Randomized Adaptive Search Procedures: Advances, Hybridizations, and Applications
Resende, M. G. C., & Ribeiro, C. C. (2010) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-1-4419-1665-5_10 · Cited by 244
Li, J.-Q., Pan, Q.-K., & Gao, K.-Z. (2011) · The International Journal of Advanced Manufacturing Technology · doi:10.1007/s00170-010-3140-2 · Cited by 244
Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns
Xiong, J., Xing, L.-N., & Chen, Y.-W. (2013) · International Journal of Production Economics · doi:10.1016/j.ijpe.2012.04.015 · Cited by 228
An effective architecture for learning and evolving flexible job-shop schedules
Ho, N. B., Tay, J. C., & Lai, E. M.-K. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.04.007 · Cited by 216
Evaluation of mathematical models for flexible job-shop scheduling problems
Demir, Y., & Kürşat İşleyen, S. (2013) · Applied Mathematical Modelling · doi:10.1016/j.apm.2012.03.020 · Cited by 204
Zhang, Q., Manier, H., & Manier, M.-A. (2011) · Computers & Operations Research · doi:10.1016/j.cor.2011.10.007 · Cited by 190
Rossi, A., & Dini, G. (2007) · Robotics and Computer-Integrated Manufacturing · doi:10.1016/j.rcim.2006.06.004 · Cited by 183
Multistage-Based Genetic Algorithm for Flexible Job-Shop Scheduling Problem
Gen, M., Gao, J., & Lin, L. (2009) · Studies in Computational Intelligence · doi:10.1007/978-3-540-95978-6_13 · Cited by 162
Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling
Xing, L., Chen, Y., & Yang, K. (2008) · Applied Soft Computing · doi:10.1016/j.asoc.2008.04.013 · Cited by 111
Tardiness minimization in a flexible job shop: A tabu search approach
Scrich, C. R., Armentano, V. A., & Laguna, M. (2003) · Journal of Intelligent Manufacturing · doi:10.1023/b:jims.0000010078.30713.e9 · Cited by 96
Producing robust schedules via an artificial immune system
Hart, E., Ross, P. D., & Nelson, J. (2002) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/icec.1998.699852 · Cited by 88
Mahdavi, I., Shirazi, B., & Solimanpur, M. (2010) · Simulation Modelling Practice and Theory · doi:10.1016/j.simpat.2010.01.015 · Cited by 86
An efficient knowledge-based algorithm for the flexible job shop scheduling problem
Karimi, H., Rahmati, S. H. A., & Zandieh, M. (2012) · Knowledge-Based Systems · doi:10.1016/j.knosys.2012.04.001 · Cited by 61
An efficient hybridized genetic algorithm architecture for the flexible job shop scheduling problem
Al‐Hinai, N., & ElMekkawy, T. Y. (2010) · Flexible Services and Manufacturing Journal · doi:10.1007/s10696-010-9067-y · Cited by 60
A new method of solving of some classes of extremal problems
Kantorovich, L. V. (1940) · Cited by 37
Li, J., Pan, Q.-K., & Xie, S. (2010) · Computer Science and Information Systems · doi:10.2298/csis090608017l · Cited by 29
Development of Both the AIS and PSO for Solving the Flexible Job Shop Scheduling Problem
Sadrzadeh, A. (2013) · Arabian Journal for Science and Engineering · doi:10.1007/s13369-013-0625-y · Cited by 27
Observer-Based Robust Control for Hydraulic Velocity Control System
Shen, W. G., Jiang, J., Karimi, H. R., et al. (2013) · Mathematical Problems in Engineering · doi:10.1155/2013/689132 · Cited by 25
Multiobjective Genetic Algorithm for Scheduling Problems in Manufacturing Systems
Gen, M., & Lin, L. (2012) · Industrial Engineering & Management Systems · doi:10.7232/iems.2012.11.4.310 · Cited by 18
Cited by
An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem
Li, X., & Gao, L. (2016) · International Journal of Production Economics · doi:10.1016/j.ijpe.2016.01.016 · Cited by 618
Metadata
- Authors
- Chaudhry, I. A., & Khan, A. A.
- Venue
- International Transactions in Operational Research
- Publisher
- Wiley
- Published
- 2015-08-07
- Volume
- 23
- Issue
- 3
- Pages
- 551-591
- ISSN
- 0969-6016 (ISSN-L)
- 1475-3995
- OpenAlex
- W2098650167
- Cited by
- 439
- References
- 48
- FWCI
- 29.87
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.