The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Energy-efficient dynamic scheduling for a flexible flow shop using an improved particle swarm optimization
Open accessAbstract
Manufacturing companies are facing the emergent challenges to meet the demand of sustainable manufacturing.Energy-efficient dynamic scheduling is a NP-hard problem presented in manufacturing systems.A novel particle swarm optimization algorithm based on Hill function is presented to minimize makespan and energy consumption.The relationship between makespan and energy consumption is conflicting.The results show that the proposed algorithm outperforms the behavior of state of the art algorithms. Due to increasing energy requirements and associated environmental impacts, nowadays manufacturing companies are facing the emergent challenges to meet the demand of sustainable manufacturing. Most existing research on reducing energy consumption in production scheduling problems has focused on static scheduling models. However, there exist many unexpected disruptions like new job arrivals and machine breakdown in a real-world production scheduling. In this paper, it is proposed an approach to address the dynamic scheduling problem reducing energy consumption and makespan for a flexible flow shop scheduling. Since the problem is strongly NP-hard, a novel algorithm based on an improved particle swarm optimization is adopted to search for the Pareto optimal solution in dynamic flexible flow shop scheduling problems. Finally, numerical experiments are carried out to evaluate the performance and efficiency of the proposed approach.
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
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
Holland, J. H. (1992) · Scientific American · doi:10.1038/scientificamerican0792-66 · Cited by 5,764
A survey of dynamic scheduling in manufacturing systems
Ouelhadj, D., & Petrović, S. (2008) · Journal of Scheduling · doi:10.1007/s10951-008-0090-8 · Cited by 1,031
A new approach to scheduling in manufacturing for power consumption and carbon footprint reduction
Fang, K., Uhan, N., Zhao, F., & Sutherland, J. W. (2011) · Journal of Manufacturing Systems · doi:10.1016/j.jmsy.2011.08.004 · Cited by 552
Dai, M., Tang, D., Giret, A., Salido, M. A., & Li, W. D. (2013) · Robotics and Computer-Integrated Manufacturing · doi:10.1016/j.rcim.2013.04.001 · Cited by 466
Self-citationBruzzone, A. A. G., Anghinolfi, D., Paolucci, M., & Tonelli, F. (2012) · CIRP Annals · doi:10.1016/j.cirp.2012.03.084 · Cited by 328
An investigation into minimising total energy consumption and total weighted tardiness in job shops
Liu, Y., Dong, H., Lohse, N., Petrovic, S., & Gindy, N. (2014) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2013.07.060 · Cited by 279
Multi-objective genetic algorithm for energy-efficient job shop scheduling
May, G., Stahl, B., Taisch, M., & Prabhu, V. (2015) · International Journal of Production Research · doi:10.1080/00207543.2015.1005248 · Cited by 222
An Investigation into Fixed Energy Consumption of Machine Tools
Li, W., Zein, A., Kara, S., & Herrmann, C. (2011) · Glocalized Solutions for Sustainability in Manufacturing · doi:10.1007/978-3-642-19692-8_47 · Cited by 201
Energy Efficiency of Manufacturing Processes: A Critical Review
Apostolos, F., Alexios, P., Georgios, P., Panagiotis, S., & George, C. (2013) · Procedia CIRP · doi:10.1016/j.procir.2013.06.044 · Cited by 188
Reactive and energy-aware scheduling of flexible manufacturing systems using potential fields
Pach, C., Berger, T., Sallez, Y., Bonte, T., Adam, E., & Trentesaux, D. (2013) · Computers in Industry · doi:10.1016/j.compind.2013.11.008 · Cited by 88
Dynamic Scheduling based on Particle Swarm Optimization for Cloud-based Scientific Experiments
Pacini, E., Mateos, C., & Garino, C. G. G. (2014) · CLEI electronic journal · doi:10.19153/cleiej.17.1.2 · Cited by 30
Dynamic scheduling of multi-task for hybrid flow-shop based on energy consumption
Zeng, L., Zou, F., Xu, X., & Gao, Z. (2009) · IEEE International Conference on Information and Automation (ICIA) · doi:10.1109/icinfa.2009.5204971 · Cited by 21
Applied research of improved hybrid discrete PSO for dynamic job-shop scheduling problem
Wang, S., Xiao, X., Fei, L., & Wang, C. (2010) · World Congress on Intelligent Control and Automation · doi:10.1109/wcica.2010.5553799 · Cited by 9
Cited by
A survey on evolutionary computation for complex continuous optimization
Zhan, Z.-H., Shi, L., Tan, K. C., & Zhang, J. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-10042-y · Cited by 416
Li, J.-Q., Sang, H.-Y., Han, Y.-Y., Wang, C.-G., & Gao, K.-Z. (2018) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2018.02.004 · Cited by 295
A review of energy-efficient scheduling in intelligent production systems
Gao, K., Huang, Y., Sadollah, A., & Wang, L. (2020) · Complex & Intelligent Systems · doi:10.1007/s40747-019-00122-6 · Cited by 274
Dynamic multi-objective scheduling for flexible job shop by deep reinforcement learning
Luo, S., Zhang, L., & Fan, Y. (2021) · Computers & Industrial Engineering · doi:10.1016/j.cie.2021.107489 · Cited by 255
Energy consumption in machining: Classification, prediction, and reduction strategy
Zhao, G. Y., Liu, Z. Y., He, Y., Cao, H. J., & Guo, Y. B. (2017) · Energy · doi:10.1016/j.energy.2017.05.110 · Cited by 253
Metadata
- Authors
- Tang, D., Dai, M., Salido, M. A., & Giret, A.
- Venue
- Computers in Industry
- Publisher
- Elsevier BV
- Published
- 2016-09
- Volume
- 81
- Pages
- 82-95
- ISSN
- 0166-3615 (ISSN-L)
- OpenAlex
- W2176672951
- Cited by
- 262
- References
- 16
- FWCI
- 27.53
- Type
- journal article
- Language
- en
- Open access
- green
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.