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)

A fine-grained parallel algorithm for the cyclic flexible job shop problem

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
/ Jarosław Pempera
  • 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-0010

Abstract

In this paper there is considered a flexible job shop problem of operations scheduling. The new, very fast method of determination of cycle time is presented. In the design of heuristic algorithm there was the neighborhood inspired by the game of golf applied. Lower bound of the criterion function was used in the search of the neighborhood.

Keywords: job shop; cyclic scheduling; parallel algorithm

References

  • [1] J.W. Barnes and J.B. Chambers: Flexible job shop scheduling by tabu search, Graduate program in operations research and industrial engineering. The University of Texas at Austin, Technical Report Series: ORP96-09, 1996.Google Scholar

  • [2] W. Bożejko, M. Uchroński and M. Wodecki: Parallel hybrid metaheuristics for the flexible job shop problem. Computers & Industrial Engineering, 59(2), (2010), 323-333.Google Scholar

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

  • [4] W. Bożejko, J. Pempera and M. Wodecki: The golf algorithm for the cyclic flexible job shop problem, (to appear).Google Scholar

  • [5] P. Brucker and T. Kampmeyer: Cyclic job shop scheduling problems with blocking. Annals of Operations Research, 159 (2008), 161-181.Web of ScienceGoogle Scholar

  • [6] M.A. González, C.R. Vela and R. Varela: Scatter search with path relinking for the flexible job shop scheduling problem. European J. of Operational Research, 245(1), (2015), 35-45.Google Scholar

  • [7] T. Kampmeyer: Cyclic Scheduling Problems. Ph.D. Thesis, University Osnabriick, 2006.Google Scholar

  • [8] F. Pezzella, G. Morganti and G. Ciaschetti: A genetic algorithm for the flexible job-shop scheduling problem. Computers & Operations Research, 35 (2008), 3202-3212.Google Scholar

  • [9] E. Nowicki and C. Smutnicki: A fast tabu serach algorithm for the job shop problem. Management Scence, 42, (1996), 797-813.Google Scholar

  • [10] C. Smutnicki, J. Pempera, J. Rudy and D. Zelazny: A new approach for multi-criteria scheduling. Computers & Industrial Engineering, 90 (2015), 212-220.CrossrefGoogle Scholar

  • [11] Y. Yuan and H. Xu: Flexible job shop scheduling using hybrid differential evolution algorithms. Computers & Industrial Engineering, 65(2), (2013), 246-260.Google Scholar

About the article

Received: 2016-12-15

Revised: 2017-04-28

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

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