The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Multiobjective Flexible Job Shop Scheduling Using Memetic Algorithms
Abstract
In this paper, we propose new memetic algorithms (MAs) for the multiobjective flexible job shop scheduling problem (MO-FJSP) with the objectives to minimize the makespan, total workload, and critical workload. The problem is addressed in a Pareto manner, which aims to search for a set of Pareto optimal solutions. First, by using well-designed chromosome encoding/decoding scheme and genetic operators, the nondominated sorting genetic algorithm II (NSGA-II) is adapted for the MO-FJSP. Then, our MAs are developed by incorporating a novel local search algorithm into the adapted NSGA-II, where some good individuals are chosen from the offspring population for local search using a selection mechanism. Furthermore, in the proposed local search, a hierarchical strategy is adopted to handle the three objectives, which mainly considers the minimization of makespan, while the concern of the other two objectives is reflected in the order of trying all the possible actions that could generate the acceptable neighbor. In the experimental studies, the influence of two alternative acceptance rules on the performance of the proposed MAs is first examined. Afterwards, the effectiveness of key components in our MAs is verified, including genetic search, local search, and the hierarchical strategy in local search. Finally, extensive comparisons are carried out with the state-of-the-art methods specially presented for the MO-FJSP on well-known benchmark instances. The results show that the proposed MAs perform much better than all the other algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Scheduling: Theory, Algorithms, and Systems
(1996) · IIE Transactions · doi:10.1080/15458830.1996.11770714 · Cited by 6,210
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
Combining Convergence and Diversity in Evolutionary Multiobjective Optimization
Laumanns, M., Thiele, L., Deb, K., & Zitzler, E. (2002) · Evolutionary Computation · doi:10.1162/106365602760234108 · Cited by 1,487
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
Statistical Comparisons of Classifiers over Multiple Data Sets
DemšarJanez (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248548 · Cited by 1,074
Solving Multiobjective Optimization Problems Using an Artificial Immune System
Coello, C. A. C., & Cort�s, N. C. (2005) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-005-6164-x · Cited by 1,062
A multi-objective genetic local search algorithm and its application to flowshop scheduling
Ishibuchi, H., & Murata, T. (1998) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/5326.704576 · Cited by 1,019
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
Ishibuchi, H., Yoshida, T., & Murata, T. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810752 · Cited by 773
A Tutorial for Competent Memetic Algorithms: Model, Taxonomy, and Design Issues
Krasnogor, N., & Smith, J. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.850260 · Cited by 727
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
Meta-Lamarckian Learning in Memetic Algorithms
Ong, Y. S., & Keane, A. J. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.819944 · Cited by 657
A tutorial survey of job-shop scheduling problems using genetic algorithms—I. representation
Cheng, R., Gen, M., & Tsujimura, Y. (1996) · Computers & Industrial Engineering · doi:10.1016/0360-8352(96)00047-2 · Cited by 635
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
Classification of adaptive memetic algorithms: a comparative study
Ong, Y.-S., Lim, M.-H., Zhu, N., & Wong, K.-W. (2006) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2005.856143 · Cited by 514
Zhang, G., Shao, X., Li, P., & Gao, L. (2009) · Computers & Industrial Engineering · doi:10.1016/j.cie.2008.07.021 · Cited by 513
Moslehi, G., & Mahnam, M. (2011) · International Journal of Production Economics · doi:10.1016/j.ijpe.2010.08.004 · Cited by 313
MOEA/D-ACO: A Multiobjective Evolutionary Algorithm Using Decomposition and AntColony
Ke, L., Zhang, Q., & Battiti, R. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2231860 · Cited by 306
A very fast TS/SA algorithm for the job shop scheduling problem
Zhang, C. Y., Li, P., Rao, Y., & Guan, Z. (2006) · Computers & Operations Research · doi:10.1016/j.cor.2006.02.024 · Cited by 265
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
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
Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem
Mei, Y., Tang, K., & Yao, X. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2051446 · Cited by 216
A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
Minella, G., Ruiz, R., & Ciavotta, M. (2008) · INFORMS Journal on Computing · doi:10.1287/ijoc.1070.0258 · Cited by 176
An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
Qian, B., Wang, L., Huang, D., Wang, W., & Wang, X. (2007) · Computers & Operations Research · doi:10.1016/j.cor.2007.08.007 · Cited by 164
Garrett, D., & Dasgupta, D. (2009) · IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making (MCDM) · doi:10.1109/mcdm.2009.4938832 · Cited by 18
Cited by
A New Dominance Relation-Based Evolutionary Algorithm for Many-Objective Optimization
Yuan, Y., Xu, H., Wang, B., & Yao, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2420112 · Cited by 752
Self-citationAn 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
A research survey: review of flexible job shop scheduling techniques
Chaudhry, I. A., & Khan, A. A. (2016) · International Transactions in Operational Research · doi:10.1111/itor.12199 · Cited by 439
Balancing Convergence and Diversity in Decomposition-Based Many-Objective Optimizers
Yuan, Y., Xu, H., Wang, B., Zhang, B., & Yao, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2443001 · Cited by 400
Self-citationFog Computing for Energy-Aware Load Balancing and Scheduling in Smart Factory
Wan, J., Chen, B., Wang, S., Xia, M., Li, D., & Liu, C. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2818932 · Cited by 322
Metadata
- Authors
- Yuan, Y., & Xu, H.
- Venue
- IEEE Transactions on Automation Science and Engineering
- Published
- 2015-01
- Volume
- 12
- Issue
- 1
- Pages
- 336-353
- ISSN
- 1545-5955 (ISSN-L)
- 1558-3783
- OpenAlex
- W1981064269
- Cited by
- 270
- References
- 26
- FWCI
- 16.99
- 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.