How to cite this paper
Li, C., Li, Y & Meng, L. (2024). An improved iterated greedy algorithm for distributed mixed no-wait permutation flowshop problems with makespan criterion.International Journal of Industrial Engineering Computations , 15(2), 553-568.
Refrences
Aldowaisan, T., & Allahverdi, A. (2004). New heuristics for m-machine no-wait flowshop to minimize total completion time. Omega, 32(5), 345-352.
Allahverdi, A., Ng, C. T., Cheng, T. C. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985-1032.
Allali, K., Aqil, S., & Belabid, J. (2022). Distributed no-wait flow shop problem with sequence dependent setup time: Optimization of makespan and maximum tardiness. Simulation Modelling Practice and Theory, 116.
Cheng, C.-Y., Ying, K.-C., Chen, H.-H., & Lu, H.-S. (2018). Minimising makespan in distributed mixed no-idle flowshops. International Journal of Production Research, 57(1), 48-60.
Cheng, C.-Y., Ying, K.-C., Li, S.-F., & Hsieh, Y.-C. (2019). Minimizing makespan in mixed no-wait flowshops with sequence-dependent setup times. Computers & Industrial Engineering, 130, 338-347.
De Giovanni, L., & Pezzella, F. (2010). An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem. European Journal of Operational Research, 200(2), 395-408.
Deng, G., Su, Q., Zhang, Z., Liu, H., Zhang, S., & Jiang, T. (2020). A population-based iterated greedy algorithm for no-wait job shop scheduling with total flow time criterion. Engineering Applications of Artificial Intelligence, 88.
Deng, J., & Wang, L. (2017). A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem. Swarm and Evolutionary Computation, 32, 121-131.
Fernandez-Viagas, V., & Framinan, J. M. (2014). A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem. International Journal of Production Research, 53(4), 1111-1123.
Fernandez-Viagas, V., Perez-Gonzalez, P., & Framinan, J. M. (2018). The distributed permutation flow shop to minimise the total flowtime. Computers & Industrial Engineering, 118, 464-477.
Gao, J., & Chen, R. (2011). A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem. International Journal of Computational Intelligence Systems, 4(4), 497-508.
Gao, J., Chen, R., & Deng, W. (2013). An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem. International Journal of Production Research, 51(3), 641-651.
Gao, K.-z., Pan, Q.-k., & Li, J.-q. (2011). Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion. The International Journal of Advanced Manufacturing Technology, 56(5-8), 683-692.
Glass, C. A., Gupta, J. N. D., & Potts, C. N. (1994). Lot streaming in three-stage production processes. European Journal of Operational Research, 75, 378-394.
Jia, H. Z., Fuh, J. Y. H., Nee, A. Y. C., & Zhang, Y. F. (2007). Integration of genetic algorithm and Gantt chart for job shop scheduling in distributed manufacturing systems. Computers & Industrial Engineering, 53(2), 313-320.
Li, J.-Q., Pan, Q.-K., & Tasgetiren, M. F. (2014). A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities. Applied Mathematical Modelling, 38(3), 1111-1132.
Li, J.-Q., Pan, Q.-K., & Mao, K. (2016). A Hybrid Fruit Fly Optimization Algorithm for the Realistic Hybrid Flowshop Rescheduling Problem in Steelmaking Systems. IEEE Transactions on Automation Science and Engineering, 13(2), 932-949.
Li, W., Li, J., Gao, K., Han, Y., Niu, B., Liu, Z., & Sun, Q. (2019). Solving robotic distributed flowshop problem using an improved iterated greedy algorithm. International Journal of Advanced Robotic Systems, 16(5).
Li, H., Li, X., & Gao, L. (2021). A discrete artificial bee colony algorithm for the distributed heterogeneous no-wait flowshop scheduling problem. Applied Soft Computing, 100.
Li, Y.-Z., Pan, Q.-K., Li, J.-Q., Gao, L., & Tasgetiren, M. F. (2021). An Adaptive Iterated Greedy algorithm for distributed mixed no-idle permutation flowshop scheduling problems. Swarm and Evolutionary Computation (Vol. 63).
Li, Y.-Z., Pan, Q.-K., Gao, K.-Z., Tasgetiren, M. F., Zhang, B., & Li, J.-Q. (2021c). A green scheduling algorithm for the distributed flowshop problem. Applied Soft Computing, 109.
Li, Y.-Z., Pan, Q.-K., He, X., Sang, H.-Y., Gao, K.-Z., & Jing, X.-L. (2022). The distributed flowshop scheduling problem with delivery dates and cumulative payoffs. Computers & Industrial Engineering, 165.
Li, Y.-Z., Pan, Q.-K., Ruiz, R., & Sang, H.-Y. (2022). A referenced iterated greedy algorithm for the distributed assembly mixed no-idle permutation flowshop scheduling problem with the total tardiness criterion. Knowledge-Based Systems (Vol. 239).
Li, Y.-Z., Gao, K., Meng, L., Jing, X.-L., & Zhang, B. (2023). Heuristics and metaheuristics to minimize makespan for flowshop with peak power consumption constraints, International Journal of Industrial Engineering Computations, 14(2), 221-238.
Lu, C., Liu, Q., Zhang, B., & Yin, L. (2022). A Pareto-based hybrid iterated greedy algorithm for energy-efficient scheduling of distributed hybrid flowshop. Expert Systems with Applications, 204.
Meng, L., Gao, K., Ren, Y., Zhang, B., Sang, H., & Chaoyong, Z. (2022). Novel MILP and CP models for distributed hybrid flowshop scheduling problem with sequence-dependent setup times. Swarm and Evolutionary Computation, 71.
Meng, L., Zhang, C., Ren, Y., Zhang, B., & Lv, C. (2020). Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem. Computers & Industrial Engineering, 142.
Miyata, H. H., & Nagano, M. S. (2021). Optimizing distributed no-wait flow shop scheduling problem with setup times and maintenance operations via iterated greedy algorithm. Journal of Manufacturing Systems, 61, 592-612.
Naderi, B., & Ruiz, R. (2010). The distributed permutation flowshop scheduling problem. Computers & Operations Research, 37(4), 754-768.
Pan, Q.-K., Fatih Tasgetiren, M., & Liang, Y.-C. (2008). A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers & Operations Research, 35(9), 2807-2839.
Pan, Q.-K., Gao, L., Wang, L., Liang, J., & Li, X.-Y. (2019). Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem. Expert Systems with Applications, 124, 309-324.
Pan, Q.-K., Gao, L., Xin-Yu, L., & Jose, F. M. (2019). Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flowshop scheduling problem. Applied Soft Computing, 81.
Pan, Q.-K., & Ruiz, R. (2014). An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem. Omega, 44, 41-50.
Pan, Q.-K., Wang, L., Tasgetiren, M. F., & Zhao, B.-H. (2007). A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion. The International Journal of Advanced Manufacturing Technology, 38(3-4), 337-347.
Pan, Q.-K., ZHAO, B.-H., & Qu, Y.-g. (2008). Heuristics for the No-Wait Flow Shop Problem with Makespan Criterion. Chinese Journal of Computers, 31(7), 1147-1154.
Pei, Z., Zhang, X., Zheng, L., & Wan, M. (2019). A column generation-based approach for proportionate flexible two-stage no-wait job shop scheduling. International Journal of Production Research, 58(2), 487-508.
RöCK, H. (1984). The Three-Machine No-Wait Flow Shop Is NP-Complete. Journal of the ACM, 31(2), 336-345.
Rossi, F. L., & Nagano, M. S. (2021). Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times. Computers & Industrial Engineering, 157.
Ruiz, R., Pan, Q.-K., & Naderi, B. (2019). Iterated Greedy methods for the distributed permutation flowshop scheduling problem. Omega, 83, 213-222.
Shao, W., Shao, Z., & Pi, D. (2021). Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem. Computers & Operations Research, 136.
Stützle, T. Applying Iterated Local Search to the Permutation Flow Shop Problem. Technical Report AIDA-98-04, FG Itellektik, FB Informatik, TU Darmstadt.
TAILLARD. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, 47(1), 65–74.
Trietsch, D., & Baker, K. R. (1993). Basic Techniques for Lot Streaming. Operations Research, 41(6), 1065-1076.
Wang, J., Wang, L., & Shen, J. (2016). A Hybrid Discrete Cuckoo Search for Distributed Permutation Flowshop Scheduling Problem. IEEE Congress on Evolutionary Computation, 2240-2246.
Wang, S.-y., Wang, L., Liu, M., & Xu, Y. (2013). An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem. International Journal of Production Economics, 145(1), 387-396.
Wang, Y., Li, X., Ruiz, R., & Sui, S. (2018). An Iterated Greedy Heuristic for Mixed No-Wait Flowshop Problems. IEEE Trans Cybern, 48(5), 1553-1566.
Yang, S., Wang, J., & Xu, Z. (2022). Real-time scheduling for distributed permutation flowshops with dynamic job arrivals using deep reinforcement learning. Advanced Engineering Informatics, 54.
Ye, H., Li, W., & Abedini, A. (2017). An improved heuristic for no-wait flow shop to minimize makespan. Journal of Manufacturing Systems, 44, 273-279.
Zhang, B., Pan, Q.-K., Gao, L., Meng, L.-L., Li, X.-Y., & Peng, K.-K. (2020). A Three-Stage Multiobjective Approach Based on Decomposition for an Energy-Efficient Hybrid Flow Shop Scheduling Problem. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 50(12), 4984-4999.
Allahverdi, A., Ng, C. T., Cheng, T. C. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985-1032.
Allali, K., Aqil, S., & Belabid, J. (2022). Distributed no-wait flow shop problem with sequence dependent setup time: Optimization of makespan and maximum tardiness. Simulation Modelling Practice and Theory, 116.
Cheng, C.-Y., Ying, K.-C., Chen, H.-H., & Lu, H.-S. (2018). Minimising makespan in distributed mixed no-idle flowshops. International Journal of Production Research, 57(1), 48-60.
Cheng, C.-Y., Ying, K.-C., Li, S.-F., & Hsieh, Y.-C. (2019). Minimizing makespan in mixed no-wait flowshops with sequence-dependent setup times. Computers & Industrial Engineering, 130, 338-347.
De Giovanni, L., & Pezzella, F. (2010). An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem. European Journal of Operational Research, 200(2), 395-408.
Deng, G., Su, Q., Zhang, Z., Liu, H., Zhang, S., & Jiang, T. (2020). A population-based iterated greedy algorithm for no-wait job shop scheduling with total flow time criterion. Engineering Applications of Artificial Intelligence, 88.
Deng, J., & Wang, L. (2017). A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem. Swarm and Evolutionary Computation, 32, 121-131.
Fernandez-Viagas, V., & Framinan, J. M. (2014). A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem. International Journal of Production Research, 53(4), 1111-1123.
Fernandez-Viagas, V., Perez-Gonzalez, P., & Framinan, J. M. (2018). The distributed permutation flow shop to minimise the total flowtime. Computers & Industrial Engineering, 118, 464-477.
Gao, J., & Chen, R. (2011). A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem. International Journal of Computational Intelligence Systems, 4(4), 497-508.
Gao, J., Chen, R., & Deng, W. (2013). An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem. International Journal of Production Research, 51(3), 641-651.
Gao, K.-z., Pan, Q.-k., & Li, J.-q. (2011). Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion. The International Journal of Advanced Manufacturing Technology, 56(5-8), 683-692.
Glass, C. A., Gupta, J. N. D., & Potts, C. N. (1994). Lot streaming in three-stage production processes. European Journal of Operational Research, 75, 378-394.
Jia, H. Z., Fuh, J. Y. H., Nee, A. Y. C., & Zhang, Y. F. (2007). Integration of genetic algorithm and Gantt chart for job shop scheduling in distributed manufacturing systems. Computers & Industrial Engineering, 53(2), 313-320.
Li, J.-Q., Pan, Q.-K., & Tasgetiren, M. F. (2014). A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities. Applied Mathematical Modelling, 38(3), 1111-1132.
Li, J.-Q., Pan, Q.-K., & Mao, K. (2016). A Hybrid Fruit Fly Optimization Algorithm for the Realistic Hybrid Flowshop Rescheduling Problem in Steelmaking Systems. IEEE Transactions on Automation Science and Engineering, 13(2), 932-949.
Li, W., Li, J., Gao, K., Han, Y., Niu, B., Liu, Z., & Sun, Q. (2019). Solving robotic distributed flowshop problem using an improved iterated greedy algorithm. International Journal of Advanced Robotic Systems, 16(5).
Li, H., Li, X., & Gao, L. (2021). A discrete artificial bee colony algorithm for the distributed heterogeneous no-wait flowshop scheduling problem. Applied Soft Computing, 100.
Li, Y.-Z., Pan, Q.-K., Li, J.-Q., Gao, L., & Tasgetiren, M. F. (2021). An Adaptive Iterated Greedy algorithm for distributed mixed no-idle permutation flowshop scheduling problems. Swarm and Evolutionary Computation (Vol. 63).
Li, Y.-Z., Pan, Q.-K., Gao, K.-Z., Tasgetiren, M. F., Zhang, B., & Li, J.-Q. (2021c). A green scheduling algorithm for the distributed flowshop problem. Applied Soft Computing, 109.
Li, Y.-Z., Pan, Q.-K., He, X., Sang, H.-Y., Gao, K.-Z., & Jing, X.-L. (2022). The distributed flowshop scheduling problem with delivery dates and cumulative payoffs. Computers & Industrial Engineering, 165.
Li, Y.-Z., Pan, Q.-K., Ruiz, R., & Sang, H.-Y. (2022). A referenced iterated greedy algorithm for the distributed assembly mixed no-idle permutation flowshop scheduling problem with the total tardiness criterion. Knowledge-Based Systems (Vol. 239).
Li, Y.-Z., Gao, K., Meng, L., Jing, X.-L., & Zhang, B. (2023). Heuristics and metaheuristics to minimize makespan for flowshop with peak power consumption constraints, International Journal of Industrial Engineering Computations, 14(2), 221-238.
Lu, C., Liu, Q., Zhang, B., & Yin, L. (2022). A Pareto-based hybrid iterated greedy algorithm for energy-efficient scheduling of distributed hybrid flowshop. Expert Systems with Applications, 204.
Meng, L., Gao, K., Ren, Y., Zhang, B., Sang, H., & Chaoyong, Z. (2022). Novel MILP and CP models for distributed hybrid flowshop scheduling problem with sequence-dependent setup times. Swarm and Evolutionary Computation, 71.
Meng, L., Zhang, C., Ren, Y., Zhang, B., & Lv, C. (2020). Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem. Computers & Industrial Engineering, 142.
Miyata, H. H., & Nagano, M. S. (2021). Optimizing distributed no-wait flow shop scheduling problem with setup times and maintenance operations via iterated greedy algorithm. Journal of Manufacturing Systems, 61, 592-612.
Naderi, B., & Ruiz, R. (2010). The distributed permutation flowshop scheduling problem. Computers & Operations Research, 37(4), 754-768.
Pan, Q.-K., Fatih Tasgetiren, M., & Liang, Y.-C. (2008). A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers & Operations Research, 35(9), 2807-2839.
Pan, Q.-K., Gao, L., Wang, L., Liang, J., & Li, X.-Y. (2019). Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem. Expert Systems with Applications, 124, 309-324.
Pan, Q.-K., Gao, L., Xin-Yu, L., & Jose, F. M. (2019). Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flowshop scheduling problem. Applied Soft Computing, 81.
Pan, Q.-K., & Ruiz, R. (2014). An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem. Omega, 44, 41-50.
Pan, Q.-K., Wang, L., Tasgetiren, M. F., & Zhao, B.-H. (2007). A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion. The International Journal of Advanced Manufacturing Technology, 38(3-4), 337-347.
Pan, Q.-K., ZHAO, B.-H., & Qu, Y.-g. (2008). Heuristics for the No-Wait Flow Shop Problem with Makespan Criterion. Chinese Journal of Computers, 31(7), 1147-1154.
Pei, Z., Zhang, X., Zheng, L., & Wan, M. (2019). A column generation-based approach for proportionate flexible two-stage no-wait job shop scheduling. International Journal of Production Research, 58(2), 487-508.
RöCK, H. (1984). The Three-Machine No-Wait Flow Shop Is NP-Complete. Journal of the ACM, 31(2), 336-345.
Rossi, F. L., & Nagano, M. S. (2021). Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times. Computers & Industrial Engineering, 157.
Ruiz, R., Pan, Q.-K., & Naderi, B. (2019). Iterated Greedy methods for the distributed permutation flowshop scheduling problem. Omega, 83, 213-222.
Shao, W., Shao, Z., & Pi, D. (2021). Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem. Computers & Operations Research, 136.
Stützle, T. Applying Iterated Local Search to the Permutation Flow Shop Problem. Technical Report AIDA-98-04, FG Itellektik, FB Informatik, TU Darmstadt.
TAILLARD. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, 47(1), 65–74.
Trietsch, D., & Baker, K. R. (1993). Basic Techniques for Lot Streaming. Operations Research, 41(6), 1065-1076.
Wang, J., Wang, L., & Shen, J. (2016). A Hybrid Discrete Cuckoo Search for Distributed Permutation Flowshop Scheduling Problem. IEEE Congress on Evolutionary Computation, 2240-2246.
Wang, S.-y., Wang, L., Liu, M., & Xu, Y. (2013). An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem. International Journal of Production Economics, 145(1), 387-396.
Wang, Y., Li, X., Ruiz, R., & Sui, S. (2018). An Iterated Greedy Heuristic for Mixed No-Wait Flowshop Problems. IEEE Trans Cybern, 48(5), 1553-1566.
Yang, S., Wang, J., & Xu, Z. (2022). Real-time scheduling for distributed permutation flowshops with dynamic job arrivals using deep reinforcement learning. Advanced Engineering Informatics, 54.
Ye, H., Li, W., & Abedini, A. (2017). An improved heuristic for no-wait flow shop to minimize makespan. Journal of Manufacturing Systems, 44, 273-279.
Zhang, B., Pan, Q.-K., Gao, L., Meng, L.-L., Li, X.-Y., & Peng, K.-K. (2020). A Three-Stage Multiobjective Approach Based on Decomposition for an Energy-Efficient Hybrid Flow Shop Scheduling Problem. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 50(12), 4984-4999.