PL
 |
EN
Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 14

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

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available A fine-grained parallel algorithm for the cyclic flexible job shop problem
100%
Bożejko W. , Pempera J. , Wodecki M.
Archives of Control Sciences
|
2017
|
tom Vol. 27, no. 2
169--181
EN
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.
2
Content available remote Efficient Approaches for Solving a Multiobjective Energy-aware Job Shop Scheduling Problem
100%
González M. A. , Oddi A. , Rasconi R.
|
2019
|
tom Vol. 167, nr 1-2
93--132
EN
One of the most recent and interesting trends in intelligent scheduling is trying to reduce the energy consumption in order to obtain lower production costs and smaller carbon footprint. In this work we consider the energy-aware job shop scheduling problem, where we have to minimize at the same time an efficiency-based objective, as is the total weighted tardiness, and also the overall energy consumption. We experimentally show that we can reduce the energy consumption of a given schedule by delaying some operations, and to this end we design a heuristic procedure to improve a given schedule. As the problem is computationally complex, we design three approaches to solve it: a Pareto-based multiobjective evolutionary algorithm, which is hybridized with a multiobjective local search method and a linear programming step, a decomposition-based multiobjective evolutionary algorithm hybridized with a single-objective local search method, and finally a constraint programming approach. We perform an extensive experimental study to analyze our algorithms and to compare them with the state of the art.
3
Content available Cyclic flow shop scheduling problem with two-machine cells
100%
Bożejko W. , Gnatowski A. , Idzikowski R. , Wodecki M.
Archives of Control Sciences
|
2017
|
tom Vol. 27, no. 2
151--167
EN
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.
4
Content available remote SMT-based Searching for κ-quasi-optimal Runs in Weighted Timed Automata
88%
Woźna-Szcześniak B. , Zbrzezny A. M. , Zbrzezny A.
Fundamenta Informaticae
|
2017
|
tom Vol. 152, nr 4
411--433
EN
We investigate a quasi-optimal cost reachability problem for weighted timed automata. We use a translation to the satisfiability modulo theories (SMT) problem to solve the problem. In particular, we show how to find a run of length κ ∊ N that starts at the initial state and terminates at a state containing the target location, its total cost belongs to the interval [c; c + 1), for some natural number c ∊ IN, and the cost of each other run of length κ, which also leads from the initial state to a state containing the target location, is greater or equal to c. This kind of run is called κ-quasi-optimal. We exemplify the use of our solution to the investigated problem by means of the weighted timed generic pipeline protocol and the weighted job shop scheduling problem, and we provide some preliminary experimental results.
5
The use of a database to visualise the sequence of Lean methods implementation steps in Job-shop production
75%
Bednár R. , Horňáková N. , Vidová H.
Logistyka
|
2013
|
tom nr 5
248--254, CD 2
EN
Methods of Lean production primarily designed for companies with mass production are commonly used in other types of manufacturing as well. Whereas the concept was not proposed for these companies, it is possible to use only a part of the procedures and achieve a partial improvement in the specific areas. The paper is focused on the implementation of Lean methods in companies with Job-shop production, visualised through the use of an information database. Diagrams of Lean methods implementation suitable for job-shop with their labels and display in the database create the basis of this paper. A survey in the V4 countries was conducted to collect information on the use of lean methods in practice. Based on this survey, the critical methods which are not suitable for companies with Job-shop production were determined. These methods are consequently visualised through the use of an information database that allows visualising the sequence of activities required to implement the Lean methods for the entity itself in a transparent manner. An information database serves as a support for decision-making in the implementation of Lean methods and also as a guide for self-help implementation of Lean methods, particularly for companies with Job-shop production.
6
Content available Analysis of the job shop system with transport and setup times in deadlock-free operating conditions
75%
Krystek J. , Kozik M.
Archives of Control Sciences
|
2012
|
tom Vol. 22, no. 4
417-425
EN
This paper presents a generalized job-shop problem taking into consideration transport time between workstations and setups machines in deadlock-free operating conditions. The automated transportation system, employing a number of automated guided vehicles is considered. The completion time of all jobs was applied as the optimization criterion. The created computational application was used to solve this problem in which chosen priority algorithms (FIFO, LIFO, LPT, SPT, EDD and LWR) were implemented. Various criteria were used to assess the quality of created schedules. Numerical results of the comparative research were presented for various criteria and rules of the priority.
7
Content available Problem gniazdowy z transportem i ograniczoną liczbą niededykowanych wózków AGV
75%
Smutnicki C. , Tyński A.
|
2005
|
tom T. 9, z. 1-2
233-244
PL
W pracy rozważa się problem gniazdowy z transportem. Do transportu zadań stosuje się identyczne, dwukierunkowe wózki AGV, których liczba jest ograniczona, zaś przydział do realizacji czynności transportowych nie jest zadany a priori. Jako kryterium optymalizacji przyjmuje się moment zakończenia wykonywania wszystkich zadań. Dla problemu proponuje się algorytm bazujący na technice poszukiwań z zabronieniami. W celu określenia jakości dostarczanych rozwiązań, algorytm poddaje się badaniom numerycznym przy użyciu instancji testowych.
EN
In this paper the job-shop scheduling problem with transportation is considered. All jobs have to be transported by the finite number of bi-directional automated guided vehicles which are identical and are not assigned to jobs a priori. As goal function we take the completion time of all jobs. For the problem, we propose the algorithm based on tabu search technique. To examine the quality of provided results, computational tests on test instances are performed.
8
Content available Exponential smoothing for multi-product lot-sizing with heijunka and varying demand
75%
Korytkowski P. , Grimaud F. , Dolgui A.
Management and Production Engineering Review
|
2014
|
tom Vol. 5, No. 2
20--26
EN
Here we discuss a multi-product lot-sizing problem for a job shop controlled with a heijunka box. Demand is considered as a random variable with constant variation which must be absorbed somehow by the manufacturing system, either by increased inventory or by flexibility in the production. When a heijunka concept (production leveling) is used, fluctuations in customer orders are not transferred directly to the manufacturing system allowing for a smoother production and better production capacity utilization. The problem rather is to determine a tradeoff between the variability in the production line capacity requirement and the inventory level.
9
Content available Optimizing the Job Shop Scheduling Problem with a no Wait Constraint by Using the Jaya Algorithm Approach
75%
Bougloula A. E.
Management and Production Engineering Review
|
2023
|
tom Vol. 14, No. 3
148--155
EN
This work is interested to optimize the job shop scheduling problem with a no wait constraint. This constraint occurs when two consecutive operations in a job must be processed without any waiting time either on or between machines. The no wait job shop scheduling problem is a combinatorial optimization problem. Therefore, the study presented here is focused on solving this problem by proposing strategy for making Jaya algorithm applicable for handling optimization of this type of problems and to find processing sequence that minimizes the makespan (Cmax). Several benchmarks are used to analyze the performance of this algorithm compared to the best-known solutions.
10
Content available remote Optimal buffer allocation in re-entrant job shop production using simulated annealing
63%
Korytkowski P. , Wisniewski T. , Zaikin O.
Management and Production Engineering Review
|
2010
|
tom Vol. 1, No. 3
30-40
EN
A re-entrant job shop production is examined in the paper. An optimization model is constructed to achieve an optimal buffer allocation ensuring profit maximization. An algorithm based on simulated annealing approach is developed to solve the problem. A real industrial application in commercial offset printing is presented. Experimental results show that the proposed methodology is effective.
11
Content available Analiza działania systemu gniazdowego z uwzględnieniem transportu i czasów przezbrojeń
63%
Krystek J. , Kozik M.
|
|
tom T. 13, z. 2
391-400
PL
W artykule przedstawiono uogólniony problem gniazdowy uwzględniający czasy transportu międzystanowiskowego oraz czasy przezbrojeń. Do rozwiązania tego problemu stworzona została aplikacja obliczeniowa, w której zaimplementowano wybrane algorytmy priorytetowe (FIFO, LIFO, LPT, SPT, EDD, LWR). Zastosowano różne kryteria do oceny jakości tworzonych harmonogramów. Zamieszczono wyniki numeryczne badań porównawczych omawianych algorytmów dla różnych kryteriów i reguł priorytetu.
EN
In the paper a job shop problem with transport and setup times is described. The application with implemented dispatch rules (FIFO, LIFO, LPT, SPT, EDD, LWR) for solving this problem has been created. It uses different criteria of estimation of schedules quality. Numerical results of comparative study of algorithms for a variety of criteria and dispatch rules are presented.
12
Porównanie wybranych metod harmonogramowania produkcji
63%
Knosala R. , Kampa A.
|
1998
|
tom Vol. 1, nr 3-4
14-18
EN
In the paper the method of scheduling are discussed. The case of the flow-shop system with variable number of machines (resources) and production orders are presented. The comparison of the different methods applications: complete reviewing, approximating reviewing, priority rules and genetic algorithm are presented.
13
Heuristic algorithm for scheduling multiple-operation jobs of cyclic manufacturing processes
63%
Raszka J. , Jamroż L.
|
2015
|
tom Vol. 36, nr 3
27--42
EN
The paper deals with the problem of evaluating the performance of job-shop systems under a cyclic manufacturing process. This process for each job is specified uniquely. Modelling based on timed event graphs terminology allows the performance of a system of repetitive production processes to be evaluated. The objective of the schedule production is to minimize the cycle time and the number of jobs that are actually required in the process. The considered problem is specified as a linear programming problem and is solved by a heuristic algorithm.
PL
rtykuł dotyczy oszacowania wydajności systemów typu job-shop, w których występują cykliczne procesy produkcyjne. Proces produkcyjny jest jednoznacznie określony dla każdego zadania. Modelowanie oparte na terminologii czasowych grafów znakowanych pozwala oszacować wydajność systemu cyklicznych procesów produkcyjnych. Celem planowania produkcji jest minimalizacja czasu cyklu i liczby zadań wymaganych w procesie. Rozważany problem przedstawiony jest jako problem programowania liniowego i rozwiązywany za pomocą algorytmu heurystycznego
14
Content available Modelling and simulation of production flow in job-shop production system with enterprise dynamics software
51%
Gola A. , Wiechetek Ł.
Applied Computer Science
|
2017
|
tom Vol. 13, no 4
87--97
EN
The paper presents capabilities of Enterprise Dynamics software in modelling and simulation of production process in job-shop conditions. The modelled production process was conducted on the total of 8 machine tools representing 5 different types. The conducted simulation represented production of three types of parts in an alternating sequence of jobs according to the technological machine sequence. The production process of the developed model was controlled by means of 4D Script programming language.
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ć.