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.

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.

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.

The objective of the milk-run design problem considered in this paper is to minimize transportation

and inventory costs by manipulating fleet size and the capacity of vehicles and

storage areas. Just as in the case of an inventory routing problem, the goal is to find a periodic

distribution policy with a plan on whom to serve, and how much to deliver by what

fleet of tugger trains travelling regularly on which routes. This problem boils down to determining

the trade-off between fleet size and storage capacity, i.e. the size of replenishment

batches that can minimize fleet size and storage capacity. A solution obtained in the declarative

model of the milk-run system under discussion allows to determine the routes for each

tugger train and the associated delivery times. In this context, the main contribution of

the present study is the identification of the relationship between takt time and the size

of replenishment batches, which allows to determine the delivery time windows for milkrun

delivery and, ultimately, the positioning of trade-off points. The results show that this

relationship is non-linear.

The article introduces an innovative approch for the inspection challenge that represents a generalization of the classical Traveling Salesman Problem. Its priciple idea is to visit continuous areas (circles) in a way, that minimizes travelled distance. In practice, the problem can be defined as an issue of scheduling unmanned aerial vehicle which has discrete-continuous nature. In order to solve this problem the use of local search algorithms is proposed.