Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "scheduling system" wg kryterium: Temat


Wyświetlanie 1-2 z 2
Tytuł:
Determining the minimum sum of production order delays in a two-machine system
Autorzy:
Jardzioch, A.
Dylewski, R.
Powiązania:
https://bibliotekanauki.pl/articles/406828.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
two-machine flow system
job scheduling
minimum delay times
Opis:
One of the main tasks in the planning of production processes is to satisfy the needs of the customers in terms of quantity, quality and time. The issue of the timely execution of production orders is becoming increasingly important. Based on the conducted studies it can be concluded that the size of the delay depends on the adopted scheduling of orders. This paper focuses on the problem of implementing a scheduling of production orders that will allow to avoid delays, and in the event such a scheduling is not possible, for minimizing the sum of delays of all the orders. A new algorithm has been proposed that allows to determine of the optimal sequence of production orders with the minimum sum of delays. The considerations have been limited to the issue of a two-machine system in which the orders are carried out in a flow.
Źródło:
Management and Production Engineering Review; 2017, 8, 3; 31-39
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Milk-run routing and scheduling subject to a trade-off between vehicle fleet size and storage capacity
Autorzy:
Bocewicz, Grzegorz
Bożejko, Wojciech
Wójcik, Robert
Banaszak, Zbigniew
Powiązania:
https://bibliotekanauki.pl/articles/406978.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
milk-run system design
routing
scheduling
trade-off point
Industry 4.0
Opis:
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.
Źródło:
Management and Production Engineering Review; 2019, 10, 3; 41-53
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies