Wyniki wyszukiwania - BazTech

1

Minimizing the Makespan and Total Tardiness in Hybrid Flow Shop Scheduling with Sequence-Dependent Setup Times

Mousavi Seyyed Mostafa, Shahnazari-Shahrezaei Parisa

Management and Production Engineering Review

|

2023

|

Vol. 14, No. 1

13--24

EN

The paper considers the production scheduling problem in a hybrid flow shop environment with sequence-dependent setup times and the objectives of minimizing both the makespan and the total tardiness. The multi-objective genetic algorithm is applied to solve this problem, which belongs to the non-deterministic polynomial-time (NP)-hard class. In the structure of the proposed algorithm, the initial population, neighborhood search structures and dispatching rules are studied to achieve more efficient solutions. The performance of the proposed algorithm compared to the efficient algorithm available in literature (known as NSGA-II) is expressed in terms of the data envelopment analysis method. The computational results confirm that the set of efficient solutions of the proposed algorithm is more efficient than the other algorithm.

2

Off-line and dynamic production scheduling - a comparative case study

Bożek A., Wysocki M.

Management and Production Engineering Review

|

2016

|

Vol. 7, No. 1

21--32

EN

A comprehensive case study of manufacturing scheduling solutions development is given. It includes highly generalized scheduling problem as well as a few scheduling modes, methods and problem models. The considered problem combines flexible job shop structure, lot streaming with variable sublots, transport times, setup times, and machine calendars. Tabu search metaheuristic and constraint programming methods have been used for the off-line scheduling. Two dynamic scheduling methods have also been implemented, i.e., dispatching rules for the completely reactive scheduling and a multi-agent system for the predictivereactive scheduling. In these implementations three distinct models of the problem have been used, based on: graph representation, optimal constraint satisfaction, and Petri net formalism. Each of these solutions has been verified in computational experiments. The results are compared and some findings about advantages, disadvantages, and suggestions on using the solutions are formulated.

3

Parameter sensitivity analysis for offset printing simulation model

Korytkowski P., Wiśniewski T., Rymaszewski S.

Przegląd Elektrotechniczny

|

2013

|

R. 89, nr 1a

99--102

EN

This paper focuses on parameter sensitivity analysis of an offset printing production system working under various dynamic dispatching rules. A discrete-event simulation model has been developed for the purpose of experimentation. Four dispatching rules from literature have been incorporated in the simulation model: EDD, LOR, SPT and FIFO. Proper management of orders’ sequence can improve manufacturing system efficiency by several percent. Performed sensitivity analysis revealed that in case of applying dispatching rules to manufacturing system the key factors are utilization and product mix. Order parameters like number of copies and number of pages are much less significant.

PL

W artykule zbadano wpływ doboru reguł priorytetowych na wybrane parametry druku offsetowego. Badania przeprowadzono korzystając z komputerowego modelu symulacyjnego. Przebadano cztery reguły priorytetowe: EDD, LOR, SPT i FIFO. Zarządzanie kolejnością zleceń w systemie może poprawić jego wydajność o kilka procent. Przeprowadzona analiza wrażliwości wykazała, że w przypadku zastosowania reguł priorytetowych do szeregowania zadań kluczowymi parametrami są poziom obciążenia sprzętu oraz produkt mix. Parametry zleceń takie jak nakład oraz liczba stron są znacznie mniej istotne.

4

Cyclic processes scheduling

Bocewicz G., Banaszak Z.

Applied Computer Science

|

2010

|

Vol. 6, no 2

41--70

EN

In everyday practice cyclic scheduling problems, especially timetabling ones arise in different application and service domains, e.g., class, train, crew timetabling, and so on. In many cases, e.g., caused by assumed slot size, imposing integer domain results in Diophantine character of problems considered. In that context some classes of cyclic scheduling problems can be seen as non-decidable (undecidable) ones. That means, since system constraints (i.e., parameter domains) determine its behavior (e.g., the space of feasible schedules), hence both system structure configuration and desired schedule have to be considered simultaneously. So, cyclic scheduling problem solution requires that the system structure configuration must be determined for the purpose of processes scheduling, yet scheduling must be done to devise the system configuration. In that context, this contribution provides discussion of some solubility issues concerning cyclic processes dispatching problems.

5

Approaches to the production flow scheduling and control

Skołud B.

Journal of Machine Engineering

|

2008

|

Vol. 8, No. 2

5--13

EN

In the paper different methods of production order scheduling and control that are elaborated by the author and the team are presented. The history starts from the dispatching rules and goes to the distributed control by the local dispatching rule allocation and application them in the software (KbRS, SWZ, etc). In the next stage of the paper the discussion goes to the integration of these approaches. Last stage of the paper the artificial intelligence (Immune Algorithm) application for optimization of the schedule under the condition that any permissible solution is attainable is proposed. This application is only the part of the integrated system and is utilized as a tool for the solution improvement.

6

Zastosowanie metod symulacyjnych w procesie planowania produkcji w systemach wytwórczo-montażowych

Krenczyk D., Dobrzańska A.

Zeszyty Naukowe Politechniki Poznańskiej. Budowa Maszyn i Zarządzanie Produkcją

|

2004

|

Nr 1

409-417

PL

W artykule przedstawiono weryfikację metody planowania współbieżnej, wieloasortymento-wej produkcji rytmicznej z wykorzystaniem metod symulacyjnych. Metoda planowania produkcji znajduje zastosowanie w odniesieniu do przedsiębiorstw wytwórczo-rnontażowych funkcjonujących w zmiennym otoczeniu, w warunkach deterministycznych ograniczeń zasobowych. Przedstawiono model przykładowego systemu wytwórczo-montażowego wykonany w komputerowym programie symulacyjnym Taylor II, który wykorzystuje język programowania TLI, umożliwiający symulację rozproszonego systemu sterowania opartego na lokalnych regułach rozstrzygania konfliktów zasobowych (LRRKZ). W dalszej części artykułu zaprezentowano eksperymenty symulacyjne obrazujące zachowanie się systemu w zależności od kolejności realizacji reguł, zarówno dla procesów wytwórczych jak i montażowych. Ponadto omówiono problem tzw. samosynchronizacji pracy systemu do pożądanego przebiegu ustalonego, w którym ujawnia się zasób krytyczny w systemie wytwórczo-montażowym.

EN

In that paper the verification of the planning method of the concurrent multiassortment rhythmic production using the simulation methods has been presented. That method is used in the manufacturing assembly enterprises working in changeable environment in conditions of necessitarian resource constraints. The model of an exemplary manufacturing assembly system made in the computer simulation program Taylor II has been shown. That program uses programming language TLI enabling the simulation of distributed production control on the basis of local dispatching rules. In the next part of that paper the carried simulations showing the system behaviour in dependence on the rules realisation order for fabrication processes as well as assembly ones has been presented. However, the problem so called system works self-synchronisation into desirable established flow characterising with a bottleneck appearing in the manufacturing assembly system has been analysed.

7

Control of the repetitive production: holonic manufacturing approach

Skołud B., Muszyński W.

Prace Naukowe Instytutu Technologii Maszyn i Automatyzacji Politechniki Wrocławskiej. Konferencje

|

2000

|

Vol. 76, nr 35

168-75

EN

The paper deals with the problem of the control of a repetitive production. The problem results from the customer demand and competition on modern markets. The approach proposed in this paper consists in defining of the dispatching rule coordinating behaviour of the system elements. The approach is compared with the biological and holonic approaches to the manufacturing problem. An example illustrating the presented approach is presented.