Advanced search
Publication Cover
International Journal of Production Research Volume 58, 2020 - Issue 13
Submit an article Journal homepage
1,203
Views
44
CrossRef citations to date
0
Altmetric
Articles

Energy-efficient scheduling for multi-objective two-stage flow shop using a hybrid ant colony optimisation algorithm

Xu Zhenga School of Management, University of Science and Technology of China, Hefei, People's Republic of ChinaORCID Iconhttps://orcid.org/0000-0002-3773-7845View further author information
ORCID Icon,
Shengchao Zhoub School of Automation, Central South University, Changsha, People's Republic of ChinaView further author information
,
Rui Xuc School of Business, Hohai University, Nanjing, People's Republic of ChinaView further author information
&
Huaping Chena School of Management, University of Science and Technology of China, Hefei, People's Republic of ChinaCorrespondence[email protected]
View further author information
Pages 4103-4120 | Received 18 Dec 2018, Accepted 29 Jun 2019, Published online: 30 Jul 2019

  • Allahverdi, A. 2016. “A Survey of Scheduling Problems with No-Wait in Process.” European Journal of Operational Research 255 (3): 665–686. doi: 10.1016/j.ejor.2016.05.036
  • Bewoor, L. A., V. C. Prakash, and S. U. Sapkal. 2017. “Evolutionary Hybrid Particle Swarm Optimization Algorithm for Solving NP-Hard No-Wait Flow Shop Scheduling Problems.” Algorithms 10 (4): 121 (17 pp.)–121 (17 pp.). doi: 10.3390/a10040121
  • Byrne, D. M., and S. Taguchi. 1987. “The Taguchi Approach to Parameter Design.” Quality Progress 20 (12): 19–26.
  • Chakravorty, A., and D. Laha. 2017. “A Heuristically Directed Immune Algorithm to Minimize Makespan and Total Flow Time in Permutation Flow Shops.” The International Journal of Advanced Manufacturing Technology 93 (9–12): 3759–3776. doi: 10.1007/s00170-017-0679-1
  • Chen, R. C., J. Chen, T. S. Chen, C. C. Huang, and L. C. Chen. 2017. “Synergy of Genetic Algorithm with Extensive Neighborhood Search for the Permutation Flowshop Scheduling Problem.” Mathematical Problems in Engineering 2019: Article ID 3630869, 9pages.
  • Cheng, M., N. J. Mukherjee, and S. C. Sarin. 2013. “A Review of Lot Streaming.” International Journal of Production Research 51 (23–24): 7023–7046. doi: 10.1080/00207543.2013.774506
  • Deb, K., A. Pratap, S. Agarwal, and T. Meyarivan. 2002. “A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II.” IEEE Transactions on Evolutionary Computation 6 (2): 182–197. doi: 10.1109/4235.996017
  • Engin, O., and A. Guclu. 2018. “A New Hybrid Ant Colony Optimization Algorithm for Solving the No-Wait Flow Shop Scheduling Problems.” Applied Soft Computing 72: 166–176. doi: 10.1016/j.asoc.2018.08.002
  • Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey.” Annals of Discrete Mathematics 5: 287–326. doi: 10.1016/S0167-5060(08)70356-X
  • Johnson, S. M. 1959. “Discussion: Sequencing N Jobs on Two Machines with Arbitrary Time Lags.” Management Science 5 (3): 299–303. doi: 10.1287/mnsc.5.3.299
  • Karimi, N., and H. Davoudpour. 2016. “Multi-objective Colonial Competitive Algorithm for Hybrid Flowshop Problem.” Applied Soft Computing 49: 725–733. doi: 10.1016/j.asoc.2016.06.034
  • Lei, D. M., L. Gao, and Y. L. Zheng. 2018. “A Novel Teaching-Learning-Based Optimization Algorithm for Energy-Efficient Scheduling in Hybrid Flow Shop.” IEEE Transactions on Engineering Management 65 (2): 330–340. doi: 10.1109/TEM.2017.2774281
  • Li, S. J., F. Liu, and X. N. Zhou. 2018. “Multi-Objective Energy-saving Scheduling for a Permutation Flow Line.” Proceedings of the Institution of Mechanical Engineers Part B-Journal of Engineering Manufacture 232 (5): 879–888. doi: 10.1177/0954405416657583
  • Li, X. T., and S. J. Ma. 2017. “Multiobjective Discrete Artificial Bee Colony Algorithm for Multiobjective Permutation Flow Shop Scheduling Problem With Sequence Dependent Setup Times.” IEEE Transactions on Engineering Management 64 (2): 149–165. doi: 10.1109/TEM.2016.2645790
  • Li, J. Q., H. Y. Sang, Y. Y. Han, C. G. Wang, and K. Z. Gao. 2018. “Efficient Multi-Objective Optimization Algorithm for Hybrid Flow Shop Scheduling Problems with Setup Energy Consumptions.” Journal of Cleaner Production 181: 584–598. doi: 10.1016/j.jclepro.2018.02.004
  • Liu, S. F., P. F. Wang, and J. C. Zhang. 2018. “An Improved Biogeography-Based Optimization Algorithm for Blocking Flow Shop Scheduling Problem.” Chinese Journal of Electronics 27 (2): 351–358. doi: 10.1049/cje.2018.01.007
  • Luo, H., B. Du, G. Q. Huang, H. P. Chen, and X. L. Li. 2013. “Hybrid Flow Shop Scheduling Considering Machine Electricity Consumption Cost.” International Journal of Production Economics 146 (2): 423–439. doi: 10.1016/j.ijpe.2013.01.028
  • Mansouri, S. A., E. Aktas, and U. Besikci. 2016. “Green Scheduling of a Two-Machine Flowshop: Trade-off Between Makespan and Energy Consumption.” European Journal of Operational Research 248 (3): 772–788. doi: 10.1016/j.ejor.2015.08.064
  • Meng, T., Q. K. Pan, J. Q. Li, and H. Y. Sang. 2018. “An Improved Migrating Birds Optimization for An Integrated Lot-Streaming Flow Shop Scheduling Problem.” Swarm and Evolutionary Computation 38: 64–78. doi: 10.1016/j.swevo.2017.06.003
  • M'Hallah, R., and A. Alhajraf. 2016. “Ant Colony Systems for the Single-Machine Total Weighted Earliness Tardiness Scheduling Problem.” Journal of Scheduling 19 (2): 191–205. doi: 10.1007/s10951-015-0429-x
  • Mokhtari, N. A., and V. Ghezavati. 2018. “Integration of Efficient Multi-Objective Ant-Colony and a Heuristic Method to Solve a Novel Multi-Objective Mixed Load School Bus Routing Model.” Applied Soft Computing 68: 92–109. doi: 10.1016/j.asoc.2018.03.049
  • Morais, M. D., M. Godinho, and T. J. P. Boiko. 2013. “Hybrid Flow Shop Scheduling Problems Involving Setup Considerations: A Literature Review and Analysis.” International Journal of Industrial Engineering-Theory Applications and Practice 20 (11–12): 614–630.
  • Mousavi, S. M., and M. Zandieh. 2018. “An Efficient Hybrid Algorithm for a Bi-Objectives Hybrid Flow Shop Scheduling.” Intelligent Automation and Soft Computing 24 (1): 9–16. doi: 10.1080/10798587.2016.1261956
  • Pinedo, Michael. 2016. Scheduling: Theory, Algorithms, and Systems. 5th ed. New York: Springer.
  • Qin, W., J. Zhang, and D. Song. 2018. “An Improved Ant Colony Algorithm for Dynamic Hybrid Flow Shop Scheduling with Uncertain Processing Time.” Journal of Intelligent Manufacturing 29 (4): 891–904. doi: 10.1007/s10845-015-1144-3
  • Riahi, V., and M. Kazemi. 2018. “A New Hybrid Ant Colony Algorithm for Scheduling of No-Wait Flowshop.” Operational Research 18 (1): 55–74. doi: 10.1007/s12351-016-0253-x
  • Rossit, D. A., F. Tohme, and M. Frutos. 2018. “The Non-Permutation Flow-Shop Scheduling Problem: A Literature Review.” Omega-International Journal of Management Science 77: 143–153. doi: 10.1016/j.omega.2017.05.010
  • Shao, W. S., D. C. Pi, and Z. S. Shao. 2017. “Optimization of Makespan for the Distributed No-Wait Flow Shop Scheduling Problem with Iterated Greedy Algorithms.” Knowledge-Based Systems 137: 163–181. doi: 10.1016/j.knosys.2017.09.026
  • Shao, Z. S., D. C. Pi, and W. S. Shao. 2018a. “Estimation of Distribution Algorithm with Path Relinking for the Blocking Flow-Shop Scheduling Problem.” Engineering Optimization 50 (5): 894–916. doi: 10.1080/0305215X.2017.1353090
  • Shao, Z. S., D. C. Pi, and W. S. Shao. 2018b. “A Novel Discrete Water Wave Optimization Algorithm for Blocking Flow-Shop Scheduling Problem with Sequence-dependent Setup Times.” Swarm and Evolutionary Computation 40: 53–75. doi: 10.1016/j.swevo.2017.12.005
  • Tan, K. C., C. K. Goh, Y. J. Yang, and T. H. Lee. 2006. “Evolving Better Population Distribution and Exploration in Evolutionary Multi-Objective Optimization.” European Journal of Operational Research 171 (2): 463–495. doi: 10.1016/j.ejor.2004.08.038
  • Tan, Y., L. Monch, and J. W. Fowler. 2018. “A Hybrid Scheduling Approach for a Two-Stage Flexible Flow Shop with Batch Processing Machines.” Journal of Scheduling 21 (2): 209–226. doi: 10.1007/s10951-017-0530-4
  • Wang, S. J., Z. G. Zhu, K. Fang, F. Chu, and C. B. Chu. 2018. “Scheduling on a Two-Machine Permutation Flow Shop Under Time-of-Use Electricity Tariffs.” International Journal of Production Research 56 (9): 3173–3187. doi: 10.1080/00207543.2017.1401236
  • Wei, J. M., and Y. G. Yu. 2018. “An Effective Hybrid Cuckoo Search Algorithm for Unknown Parameters and Time Delays Estimation of Chaotic Systems.” IEEE Access 6: 6560–6571. doi: 10.1109/ACCESS.2017.2738006
  • Wu, C. C., J. Y. Chen, W. C. Lin, K. J. Lai, S. C. Liu, and P. W. Yu. 2018a. “A Two-Stage Three-Machine Assembly Flow Shop Scheduling with Learning Consideration to Minimize the Flowtime by Six Hybrids of Particle Swarm Optimization.” Swarm and Evolutionary Computation 41: 97–110. doi: 10.1016/j.swevo.2018.01.012
  • Wu, C. C., D. J. Wang, S. R. Cheng, I. H. Chung, and W. C. Lin. 2018b. “A Two-Stage Three-Machine Assembly Scheduling Problem with a Position-Based Learning Effect.” International Journal of Production Research 56 (9): 3064–3079. doi: 10.1080/00207543.2017.1401243
  • Yaurima-Basaldua, V. H., A. Tchernykh, F. Villalobos-Rodriguez, and R. Salomon-Torres. 2018. “Hybrid Flow Shop with Unrelated Machines, Setup Time, and Work in Progress Buffers for Bi-Objective Optimization of Tortilla Manufacturing.” Algorithms 11 (5): 68 (23 pp.)–68 (23 pp.). doi: 10.3390/a11050068
  • Zeng, Z. Q., M. N. Hong, Y. Man, J. G. Li, Y. Z. Zhang, and H. B. Liu. 2018. “Multi-Object Optimization of Flexible Flow Shop Scheduling with Batch Process – Consideration Total Electricity Consumption and Material Wastage.” Journal of Cleaner Production 183: 925–939. doi: 10.1016/j.jclepro.2018.02.224
  • Zhang, H., J. Cai, K. Fang, F. Zhao, and J. W. Sutherland. 2017. “Operational Optimization of a Grid-Connected Factory with Onsite Photovoltaic and Battery Storage Systems.” Applied Energy 205: 1538–1547. doi: 10.1016/j.apenergy.2017.08.140
  • Zheng, X., S. Zhou, and H. Chen. 2018. “Ant Colony Optimisation Algorithms for Two-stage Permutation Flow Shop with Batch Processing Machines and Nonidentical Job Sizes.” International Journal of Production Research 57 (10): 3060–3079. doi: 10.1080/00207543.2018.1529445
  • Zhong, W. Y., and Y. Shi. 2018. “Two-Stage No-Wait Hybrid Flowshop Scheduling with Inter-Stage Flexibility.” Journal of Combinatorial Optimization 35 (1): 108–125. doi: 10.1007/s10878-017-0155-8
  • Zhou, S. C., X. P. Li, H. P. Chen, and C. Guo. 2016. “Minimizing Makespan in a No-Wait Flowshop with Two Batch Processing Machines Using Estimation of Distribution Algorithm.” International Journal of Production Research 54 (16): 4919–4937. doi: 10.1080/00207543.2016.1140920
  • Zhou, S. C., X. L. Li, N. Du, Y. Pang, and H. P. Chen. 2018. “A Multi-Objective Differential Evolution Algorithm for Parallel Batch Processing Machine Scheduling Considering Electricity Consumption Cost.” Computers & Operations Research 96: 55–68. doi: 10.1016/j.cor.2018.04.009
  • Zitzler, Eckart, Marco Laumanns, and Lothar Thiele. 2001a. “SPEA2: Improving the Strength Pareto Evolutionary Algorithm.” TIK-report 103.
  • Zitzler, Eckart, Marco Laumanns, and Lothar Thiele. 2001b. SPEA2: Improving the Strength Pareto Evolutionary Algorithm for Multiobjective Optimization. Vol. 3242.
  • Zitzler, E., and L. Thiele. 1999. “Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach.” IEEE Transactions on Evolutionary Computation 3 (4): 257–271. doi: 10.1109/4235.797969

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.