Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Archives of Control Sciences

The Journal of Polish Academy of Sciences

4 Issues per year


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

Open Access
Online
ISSN
2300-2611
See all formats and pricing
More options …
Volume 27, Issue 2 (Jun 2017)

Parallel patterns determination in solving cyclic flow shop problem with setups

Wojciech Bożejko
  • Corresponding author
  • Department of Automatics, Mechatronics and Control Systems, Faculty of Electronics, Wrocław University of Technology, Janiszewskiego 11-17, 50-372 Wrocław, Poland.
  • Email
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
/ Zenon Chaczko
  • Faculty of Engineering and Information Technology (FEIT), University of Technology, Sydney(UTS), Australia, NSW, Sydney
  • Email
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
/ Mariusz Uchroński
  • Department of Automatics, Mechatronics and Control Systems, Faculty of Electronics, Wrocław University of Technology, Janiszewskiego 11-17, 50-372 Wrocław, Poland.
  • Email
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
/ Mieczysław Wodecki
Published Online: 2017-06-26 | DOI: https://doi.org/10.1515/acsc-2017-0011

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.

Keywords: cyclic scheduling; parallel algorithm; metaheuristics

References

  • [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.Google Scholar

  • [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.Google Scholar

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

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

  • [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.Google Scholar

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

  • [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.Google Scholar

  • [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.Google Scholar

  • [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.Google Scholar

  • [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.CrossrefGoogle Scholar

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

  • [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.Google Scholar

  • [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.Web of ScienceGoogle Scholar

  • [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.Google Scholar

About the article

Received: 2016-12-14

Revised: 2017-04-30

Published Online: 2017-06-26

Published in Print: 2017-06-01


Citation Information: Archives of Control Sciences, ISSN (Online) 2300-2611, DOI: https://doi.org/10.1515/acsc-2017-0011.

Export Citation

© 2017 Archives of Control Sciences. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License. BY-NC-ND 3.0

Comments (0)

Please log in or register to comment.
Log in