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)

Cyclic flow shop scheduling problem with two-machine cells

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
/ Andrzej Gnatowski
  • 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
/ Radosław Idzikowski
  • 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-0009

Abstract

In the paper a variant of cyclic production with setups and two-machine cell is considered. One of the stages of the problem solving consists of assigning each operation to the machine on which it will be carried out. The total number of such assignments is exponential. We propose a polynomial time algorithm finding the optimal operations to machines assignment.

Keywords: job shop; cyclic scheduling; multi-machine; assignment

References

  • [1] W. Bożejko, M. Uchroński and M. Wodecki: Parallel metaheuristics for the cyclic flow shop scheduling problem. Computers & Industrial Engineering, 95 (2016), 156-163.CrossrefGoogle Scholar

  • [2] W. Bożejko, A. Gnatowski, T. Niżyński and M. Wodecki: Tabu search algorithm with neural tabu mechanism for the cyclic job shop problem. In Artificial Intelligence and Soft Computing: 15th International Conference, ICAISC 2016, Zakopane, Poland, June 12-16, 2016, Proceedings, Part II, L. Rutkowski, M. Korytkowski, R. Scherer, R. Tadeusiewicz, L. A. Zadeh, and J. M. Zurada, Eds. Springer International Publishing, Cham, 2016, 409-418.Google Scholar

  • [3] W. Bożejko, M. Uchroński and M. Wodecki: Multi-GPU Tabu Search Metaheuristic for the Flexible Job Shop Scheduling Problem. Springer International Publishing, Heidelberg, 2014, 43-60.Google Scholar

  • [4] W. Bożejko and M. Wodecki: Problemy cykliczne z równoległymi maszynami (in Polish). In Automatyzacja procesów dyskretnych, Teoria i zastosowania (red. A. Świerniak, J. Krystek), A. Świerniak and J. Krystek, Eds. Gliwice, 2014, 27-36.Google Scholar

  • [5] F. Glover: Future paths for integer programming and links to artificial intelligence. Computer & Operational Research, 13(5), (1986), 533-549.Google Scholar

  • [6] A. Gnatowski: Benchmarks for nonpermutational flowshop with 2-machine nests and cycle time criterion. 2016. http://wojciech.bozejko.staff.iiar.pwr.wroc.pl/Benchmarks/F_cycle_nonperm/F_cycle_2machines_benchmarks.zip, Available online [2017-03-13].

  • [7] A. Gnatowski: Finding properties of an assignment problem in application to cyclic scheduling problems (in Polish). Tech. Rep. PRE No. 5, Faculty of Electronics, Wrocław University of Science and Technology, 2016.Google Scholar

  • [8] T. Kampmeyer: Cyclic Scheduling Problems. PhD thesis, University Osnabrück, 2006.Google Scholar

  • [9] E. Levner, V. Kats, D.A.L. de Pablo and T. Cheng: Complexity of cyclic scheduling problems: A state-of-the-art survey. Computers & Industrial Engineering, 59(2), (2010), 352-361.CrossrefGoogle Scholar

  • [10] E. Nowicki and C. Smutnicki: A fast taboo search algorithm for the job shop problem. Management science, 42(6), (1996), 797-813.CrossrefGoogle Scholar

  • [11] T. Sawik: A mixed integer programming for cyclic scheduling of flexible flow lines. Bulletin of the Polish Academy of Sciences, Technical Sciences, 62(1), (2014), 121-128.Google Scholar

About the article

Received: 2016-12-14

Revised: 2017-04-27

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-0009.

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

Citing Articles

Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.

[1]
Wojciech Bożzejko, Andrzej Gnatowski, Jarosław Pempera, and Mieczysław Wodecki
Computers & Industrial Engineering, 2017

Comments (0)

Please log in or register to comment.
Log in