Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  planowania zadań
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
We study a production scheduling problem, which adresses on the one hand the usual operational constraints such as the precedence of operations, time windows, delays, uniqueness of treatment, availability of resources, and waiting times. On the other hand, the problem takes into account possible restricted movements according to production orders. This problem is a variant of a flexible job shop scheduling problem with several types of sequence-dependent constraints. We consider additional sequence-dependent setup times, as well as sequence-dependent transportation and assignment restrictions. We propose a mixed integer programming model (MIP). It is based on the MIP model of a flexible job shop scheduling problem, in which we add those sequence-dependent constraints. We solve it with a general purpose MIP solver.
EN
This paper presents the issue of task scheduling, which aims in establishing a sequence of tasks, which maximizes the utilization of company’s production capacity. The problem belongs to the NP-hard class, optimal method of solution has not yet been found, only approximate solutions have been offered. Regardless of specific production system, while considering reception of new tasks into the system, current review of the state of the system is required in order to decide whether and when a new order can be accepted for execution. In this paper, the problem of task scheduling is limited to determining the field of possible solutions to the problem of appropriate prioritization of production (production orders) which in turn will be accepted for execution on the assembly line in the car industry company. Simplified structure of the production system, orders transition paths and scheduling concepts within the system limitations have been presented.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.