Parallel patterns determination in solving cyclic flow shop problem with setups

Open access

Abstract

The subject of this work is the new idea of blocks for the cyclic flow shop problem with setup times, using multiple patterns with different sizes determined for each machine constituting optimal schedule of cities for the traveling salesman problem (TSP). We propose to take advantage of the Intel Xeon Phi parallel computing environment during so-called ’blocks’ determination basing on patterns, in effect significantly improving the quality of obtained results.

[1] Bożejko W., Uchroñski M., Wodecki M. (2016). Parallel metaheuristics for the cyclic flow shop scheduling problem. Computers & Industrial Engineering, 95, 156–163.

[2] Bożejko, W., Pempera, J., Wodecki, M. (2015). Parallel Simulated Annealing Algorithm for Cyclic Flexible Job Shop Scheduling Problem. Lecture Notes in Artificial Intelligence No. 9120, Springer, 603–612.

[3] Bożejko, W., Uchroṉski, M., Wodecki, M. (2015). Block approach to the cyclic flow shop scheduling. Computers & Industrial Engineering, 81, 158–166.

[4] Bożejko, W., Wodecki, M. (2007). On the theoretical properties of swap multimoves. Operations Research Letters, 35(2), 227–231.

[5] Brucker, P., Burke, E. K., Groenemeyer, S. (2012). A branch and bound algorithm for the cyclic job-shop problem with transportation. Computers & Operations Research, 39, 12, 3200–3214.

[6] Gertsbakh, I., Serafini, P. (1991). Periodic transportation schedules with flexible departure times. European Journal of Operational Research, 50, 298-309.

[7] Grabowski, J., Wodecki, M. (2004). A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Computers & Operations Research, 31, 1891–1909.

[8] Kats, V., Levner, E. (2010). A fast algorithm for a cyclic scheduling problem with interval data. In Proceedings of the annual operations research society of Israel (ORSIS-2010) conference, February 2010, Nir Etzion, Israel.

[9] Mendez, C. A., Cerda, J., Grossmann, I. E., Harjunkoski, I., Fahl, M. (2006). State-of-the-art review of optimization methods for short-term scheduling of batch processes. Computers and Chemical Engineering, 30, 913-946.

[10] Nawaz, M., Enscore, Jr, E.E., Ham, I. (1983). A heuristic algorithm for the m–machine, n–job flow–shop sequencing problem. OMEGA International Journal of Management Science, 11, 91–95.

[11] Pinedo, M. (2005). Planning and scheduling in manufacturing and services. New York: Springer.

[12] Pinnto, T., Barbosa-Povoa, A. P. F. D., Novais, A. Q. (2005). Optimal design and retrofit of batch plants with a periodic mode of operation. Computers and Chemical Engineering, 29, 1293–1303.

[13] Ruiz, R., Stützle, T. (2008). An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. European Journal of Operational Research, 187(3), 1143–1159.

[14] Smutnicki, C., New features of the cyclic job shop scheduling problem. In Proceedings of 20th International Conference on Methods and Models in Automation and Robotics MMAR 2015, IEEE Press, 1000–1005.

Archives of Control Sciences

The Journal of Polish Academy of Sciences

Journal Information


IMPACT FACTOR 2016: 0.705

CiteScore 2016: 3.11

SCImago Journal Rank (SJR) 2016: 0.231
Source Normalized Impact per Paper (SNIP) 2016: 0.565

Metrics

All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 52 52 17
PDF Downloads 27 27 9