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.
 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.
 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.
 W. Bożejko, M. Uchroński and M. Wodecki: Block approach to the cyclic flow shop scheduling. Computers & Industrial Engineering, 81 (2015), 158-166.
 W. Bożejko, J. Pempera and M. Wodecki: The golf algorithm for the cyclic flexible job shop problem, (to appear).
 P. Brucker and T. Kampmeyer: Cyclic job shop scheduling problems with blocking. Annals of Operations Research, 159 (2008), 161-181.
 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.
 T. Kampmeyer: Cyclic Scheduling Problems. Ph.D. Thesis, University Osnabriick, 2006.
 F. Pezzella, G. Morganti and G. Ciaschetti: A genetic algorithm for the flexible job-shop scheduling problem. Computers & Operations Research, 35 (2008), 3202-3212.
 E. Nowicki and C. Smutnicki: A fast tabu serach algorithm for the job shop problem. Management Scence, 42, (1996), 797-813.
 C. Smutnicki, J. Pempera, J. Rudy and D. Zelazny: A new approach for multi-criteria scheduling. Computers & Industrial Engineering, 90 (2015), 212-220.
 Y. Yuan and H. Xu: Flexible job shop scheduling using hybrid differential evolution algorithms. Computers & Industrial Engineering, 65(2), (2013), 246-260.