Vấn đề lập lịch dòng chảy hoán vị phân tán với mục tiêu tối thiểu hóa thời gian hoàn thành tổng thể

Bargaoui, H., Belkahla Driss, O., Ghédira, K.: A novel chemical reaction optimization for the distributed permutation flowshop scheduling problem with makespan criterion. Comput. Ind. Eng. 111, 239–250 (2017)

Chan, F.T.S., Chung, S.H., Chan, P.L.Y.: An adaptive genetic algorithm with dominated genes for distributed scheduling problems. Expert. Syst. Appl. 29(2), 364–371 (2005)

Chan, H.K., Chung, S.H.: Optimisation approaches for distributed scheduling problems. Int. J. Prod. Res. 51(9), 2571–2577 (2013)

De Giovanni, L., Pezzella, F.: An Improved Genetic algorithm for the distributed and flexible Job-shop scheduling problem. Eur. J. Oper. Res. 200(2), 395–408 (2010)

Fan, S.K.S.: Quality improvement of chemical-mechanical wafer planarization process in semiconductor manufacturing using a combined generalized linear modelling - non-linear programming approach. Int. J. Prod. Res. 38(13), 3011–3029 (2000)

Fernandez-Viagas, V., Framinan, J.M.: A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem. Int. J. Prod. Res. 53(4), 1111–1123 (2015)

Fernandez-Viagas, V., Perez-Gonzalez, P., Framinan, J.M.: The distributed permutation flow shop to minimise the total flowtime. Comput. Ind. Eng. 118(March), 464–477 (2018)

Gajpal, Y., Rajendran, C.: An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops. Int. J. Prod. Econ. 101(2), 259–272 (2006)

Gao, J., Chen, R., Deng, W.: An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem. Int. J. Prod. Res. 51(3), 641–651 (2013)

Gao, J., Chen, R.: A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem. Int. J. Comput. Intell. Syst. 4(4), 497–508 (2011)

Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533–549 (1993)

Gnoni, M.G., Iavagnilio, R., Mossa, G., Mummolo, G., Di Leva, A.: Production planning of a multi-site manufacturing system by hybrid modelling: A case study from the automotive industry. Int. J. Prod. Econ. 85(2), 251–262 (2003)

Gupta, D., Sharma, S., Aggarwal, S.: Flow shop scheduling on 2-machines with setup time and single transport facility under fuzzy environment. Opsearch. 50(1), 14–24 (2013)

Jia, H.Z., Fuh, J.Y.H., A.Y.C. Nee YFZ. : Web-based multi-functional scheduling system for a distributed manufacturing environment. Concur. Eng. 11(4), 249–265 (2003)

Jia, H.Z., Nee, A.Y.C., Fuh, J.Y.H., Zhang, Y.F.: A modified genetic algorithm for distributed scheduling problems. J. Intell. Manuf. 14(3–4), 351–362 (2003)

Johnson, S.M.: Optimal two-and three-stage production schedules with setup times included. NAV. RES. LOG. 1(1), 61–68 (1954)

Kahn, K.B.: The PDMA handbook of new product development. Wiley, NewYork (2012)

Komaki, G.M., Mobin, S., Teymourian, E., Sheikh, S.: A General Variable Neighborhood Search Algorithm to Minimize Makespan of the Distributed Permutation Flowshop Scheduling Problem. World. Acad. Sci. Eng. Technol. Int. J. Soc. Behav. Educ. Econ. Bus. Ind. Eng. 9(8), 2582–2589 (2015)

Leung, S.C.H., Wu, Y., Lai, K.K.: Multi-site aggregate production planning with multiple objectives: A goal programming approach. Prod. Plan. Control. 14(5), 425–436 (2003)

Li Y, Chen Z. 2015. The distributed permutation flowshop scheduling problem: A genetic algorithm approach. 2015 3rd International Conference on Mechatronics and Industrial Informatics (ICMII):381–384.

Lin, S.W., Ying, K.C., Huang, C.Y.: Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm. Int. J. Prod. Res. 51(16), 5029–5038 (2013)

Lin, S.W., Ying, K.C.: Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems. Int. J. Prod. Res. 47(5), 1411–1424 (2009)

Liu H, Gao L. 2010. A discrete electromagnetism-like mechanism algorithm for solving distributed permutation flowshop scheduling problem. Proc - 2010 Int Conf Manuf Autom ICMA 2010.:156–163.

Naderi, B., Ruiz, R.: The distributed permutation flowshop scheduling problem. Comput. Oper. Res. 37(4), 754–768 (2010)

Naderi, B., Ruiz, R.: A scatter search algorithm for the distributed permutation flowshop scheduling problem. Eur. J. Oper. Res. 239(2), 323–334 (2014)

Osman, I., Potts, C.: Simulated annealing for permutation flow-shop scheduling. Omega. 17(6), 551–557 (1989)

Pan, Q.K., Gao, L., Wang, L., Liang, J., Li, X.Y.: Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem. Expert. Syst. Appl. 124, 309–324 (2019)

Prasad, S.D.: A genetic algorithm for flowshop scheduling with multiple objectives. Opsearch. 44(1), 1–16 (2007)

Ropke, S., Pisinger, D.: A unified heuristic for a large class of Vehicle Routing Problems with Backhauls. Eur. J. Oper. Res. 171(3), 750–775 (2006)

Ruiz, R., Pan, Q.K., Naderi, B.: Iterated Greedy methods for the distributed permutation flowshop scheduling problem. Omega (United Kingdom). 83, 213–222 (2019)

Ruiz, R., Stützle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur. J. Oper. Res. 177(3), 2033–2049 (2007)

Sambasivan, M., Yahya, S.: A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers. Comput. Oper. Res. 32(3), 537–555 (2005)

Shabtay, D., Bensoussan, Y., Kaspi, M.: A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system. Int. J. Prod. Econ. 136(1), 67–74 (2012)

Wang FY, Chua TJ, Cai TX, Chai LS. 2007. Common capacity modelling for multi-site planning: Case studies. IEEE Int Conf Emerg Technol Fact Autom ETFA.:336–343.

Wang J, Wang L, Shen J. 2016. A hybrid discrete cuckoo search for distributed permutation flowshop scheduling problem. 2016 IEEE Congr Evol Comput CEC. (2013):2240–2246.

Wang, S., Wang, X., Chu, F., Yu, J.: An energy-efficient two-stage hybrid flow shop scheduling problem in a glass production. Int. J. Prod. Res. 58(8), 2283–2314 (2020)

Wang, S.Y., Wang, L., Liu, M., Xu, Y.: An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem. Int. J. Prod. Econ. 145(1), 387–396 (2013)

Wilkinson, S.J., Cortier, A., Shah, N., Pantelides, C.C.: Integrated production and distribution scheduling on a Europe-wide basis. Comput. Chem. Eng. 20(96), S1275–S1280 (1996)

Xu, Y., Wang, L., Wang, S., Liu, M.: An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem. Eng. Optim. 46(9), 1269–1283 (2014)