Temat: dispatching rule - Prolib Integro

Skocz do pozycji: 1.

Tytuł:: Approaches to the production flow scheduling and control
Autorzy:: Skołud, B.
Tematy:: production flow
scheduling
dispatching rule
constraint satisfaction
immune algorithm; Pokaż więcej
Wydawca:: Wrocławska Rada Federacji Stowarzyszeń Naukowo-Technicznych
Powiązania:: https://bibliotekanauki.pl/articles/1429346.pdf Link otwiera się w nowym oknie
Opis:: 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.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 2.

Tytuł:: Minimizing the Makespan and Total Tardiness in Hybrid Flow Shop Scheduling with Sequence-Dependent Setup Times
Autorzy:: Mousavi, Seyyed Mostafa
Shahnazari-Shahrezaei, Parisa
Tematy:: dispatching rule
genetic algorithm
hybrid flow shop
neighborhood search structure; Pokaż więcej
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Powiązania:: https://bibliotekanauki.pl/articles/2201180.pdf Link otwiera się w nowym oknie
Opis:: 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.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 3.

Tytuł:: Cyclic processes scheduling
Autorzy:: Bocewicz, G.
Banaszak, Z.
Tematy:: cyclic processes
cyclic scheduling
time-table
periodicity
periodic timetables
dispatching rule; Pokaż więcej
Wydawca:: Polskie Towarzystwo Promocji Wiedzy
Powiązania:: https://bibliotekanauki.pl/articles/117827.pdf Link otwiera się w nowym oknie
Opis:: 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.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 4.

Tytuł:: Off-line and dynamic production scheduling - a comparative case study
Autorzy:: Bożek, A.
Wysocki, M.
Tematy:: flexible job shop
lot streaming
off-line scheduling
dynamic scheduling
tabu search
constraint programming
dispatching rule
Petri nets
multi-agent systems; Pokaż więcej
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Powiązania:: https://bibliotekanauki.pl/articles/406687.pdf Link otwiera się w nowym oknie
Opis:: 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.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Informacja

Wyszukujesz frazę "dispatching rule" wg kryterium: Temat