Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Makespan" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 18
Tytuł:
A note on hardness of multiprocessor scheduling with scheduling solution space tree
Autorzy:
Dwibedy, Debasis
Mohanty, Rakesh
Powiązania:
https://bibliotekanauki.pl/articles/27312879.pdf
Data publikacji:
2023
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
combinatorial structures
computational complexity
hardness
makespan
multiprocessor scheduling
multiuser
NP-completeness
nondeterministic algorithms
reduction
scheduling solution space tree
Opis:
We study the hardness of the non-preemptive scheduling problem of a list of independent jobs on a set of identical parallel processors with a makespan minimization objective. We make a maiden attempt to explore the combinatorial structure of the problem by introducing a scheduling solution space tree (SSST) as a novel data structure. We formally define and characterize the properties of SSST through our analytical results. We show that the multiprocessor scheduling problem is N P-complete with an alternative technique using SSST and weighted scheduling solution space tree (WSSST) data structures. We propose a non-deterministic polynomial-time algorithm called magic scheduling (MS) based on the reduction framework. We also define a new variant of multiprocessor scheduling by including the user as an additional input parameter, which we called the multiuser multiprocessor scheduling problem (MUMPSP). We also show that MUMPSP is N P-complete. We conclude the article by exploring several non-trivial research challenges for future research investigations.
Źródło:
Computer Science; 2023, 24 (1); 53--74
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Advanced cascaded scheduling for highly autonomous production cells with material flow and tool lifetime consideration using AGVs
Autorzy:
Miller, Eddi
Engelmann, Bastian
Kaupp, Tobias
Schmitt, Jan
Powiązania:
https://bibliotekanauki.pl/articles/24084716.pdf
Data publikacji:
2023
Wydawca:
Wrocławska Rada Federacji Stowarzyszeń Naukowo-Technicznych
Tematy:
scheduling
robotic cell
algorithm
makespan optimization
Opis:
In today’s manufacturing systems, especially in Industry 4.0, highly autonomous production cells play an important role. To reach this goal of autonomy, different technologies like industrial robots, machine tools, and automated guided vehicles (AGV) are deployed simultaneously which creates numerous challenges on various automation levels. One of those challenges regards the scheduling of all applied resources and their corresponding tasks. Combining data from a real production environment and Constraint Programming (CP-SAT), we provide a cascaded scheduling approach that plans production orders for machine tools to minimize makespan and tool changeover time while enabling the corresponding robot for robot-collaborated processes. Simultaneously, AGVs provide all production cells with the necessary material and tools. Hereby, magazine capacity for raw material as well as finished parts and tool service life are taken into account.
Źródło:
Journal of Machine Engineering; 2023, 23, 3; 69--85
1895-7595
2391-8071
Pojawia się w:
Journal of Machine Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An optimum scheduling method for multi-option product flows through production lineswithout intermediate buffers
Autorzy:
Magiera, Marek
Powiązania:
https://bibliotekanauki.pl/articles/406718.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Flexible Manufacturing Systems
integer programming
linear programming
no-wait scheduling
hybrid flow shop
makespan
decision making
Opis:
The presented method is constructed for optimum scheduling in production lines with parallel machines and without intermediate buffers. The production system simultaneously performs operations on various types of products. Multi-option products were taken into account – products of a given type may differ in terms of details. This allows providing for individual requirements of the customers. The one-level approach to scheduling for multioption products is presented. The integer programming is used in the method – optimum solutions are determined: the shortest schedules for multi-option products. Due to the lack of the intermediate buffers, two possibilities are taken into account: no-wait scheduling, possibility of the machines being blocked by products awaiting further operations. These two types of organizing the flow through the production line were compared using computational experiments, the results of which are presented in the paper.
Źródło:
Management and Production Engineering Review; 2020, 11, 1; 86-94
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scheduling battery charging jobs with linearly decreasing power demands to minimize the total time
Autorzy:
Różycki, R.
Waligóra, G.
Węglarz, J.
Powiązania:
https://bibliotekanauki.pl/articles/200446.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
scheduling
makespan
power
energy
continuous resource
Opis:
In this work we consider a problem from the field of power- and energy-aware scheduling, in which a set of batteries have to be charged in a minimum time. The formulated problem is to schedule independent and nonpreemptable jobs to minimize the schedule length, where each job requires some amount of power and consumes a certain amount of energy during its processing. We assume that the power demand of each job linearly decreases with time, as it is the case when Li-ion batteries are being charged. For the assumed job model we prove that each next job should be started as soon as the required amount of power is available. Basing on the proven theorem we formulate a procedure generating a minimum-length schedule for an assumed order of jobs. We also analyze the case of identical jobs, and show some interesting properties of this case.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2020, 68, 2; 299-306
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Exploring heuristic techniques for flow shop scheduling
Autorzy:
Soltysova, Zuzana
Semanco, Pavol
Modrak, Jan
Powiązania:
https://bibliotekanauki.pl/articles/407377.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
benchmarking
flow shop
makespan
relative percent deviation
heuristics
Opis:
This paper explores selected heuristics methods, namely CDS, Palmer’s slope index, Gupta’s algorithm, and concurrent heuristic algorithm for minimizing the makespan in permutation flow shop scheduling problem. Its main scope is to explore how different instances sizes impact on performance variability. The computational experiment includes 12 of available benchmark data sets of 10 problems proposed by Taillard. The results are computed and presented in the form of relative percentage deviation, while outputs of the NEH algorithm were used as reference solutions for comparison purposes. Finally, pertinent findings are commented.
Źródło:
Management and Production Engineering Review; 2019, 10, 3; 54--60
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Particle swarm optimization and discrete artificial bee colony algorithms for solving production scheduling problems
Autorzy:
Witkowski, Tadeusz
Powiązania:
https://bibliotekanauki.pl/articles/298169.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Warmińsko-Mazurski w Olsztynie
Tematy:
Discrete Artificial Bee Colony
particle swarm optimization (PSO)
production scheduling problem
makespan
Opis:
This paper shows the use of Discrete Artificial Bee Colony (DABC) and Particle Swarm Optimization (PSO) algorithm for solving the job shop scheduling problem (JSSP) with the objective of minimizing makespan. The Job Shop Scheduling Problem is one of the most difficult problems, as it is classified as an NP-complete one. Stochastic search techniques such as swarm and evolutionary algorithms are used to find a good solution. Our objective is to evaluate the efficiency of DABC and PSO swarm algorithms on many tests of JSSP problems. DABC and PSO algorithms have been developed for solving real production scheduling problem too. The experiment results indicate that this problem can be effectively solved by PSO and DABC algorithms.
Źródło:
Technical Sciences / University of Warmia and Mazury in Olsztyn; 2019, 22(1); 61-74
1505-4675
2083-4527
Pojawia się w:
Technical Sciences / University of Warmia and Mazury in Olsztyn
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scheduling of Flowshop Type Production with Dannenbring Method to Obtain Optimal Results with Observing Waiting Time and Weight of Jobs
Autorzy:
Rahmani, Ulfa
Wulan, Elis Ratna
Huda, Arief Fatchul
Supian, Sudradjat
Subiyanto, Subiyanto
Powiązania:
https://bibliotekanauki.pl/articles/1062846.pdf
Data publikacji:
2019
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Linear Programming
Makespan
Weigted Mean Flow Time
Opis:
Linear programming is a step or process to get maximum results with existing resources or it can be said the process of looking for optimal value. One part of scheduling is production scheduling. production scheduling is the use of resources that are few but make the most profit. This paper discusses production scheduling using flowshop type production scheduling by taking into account transportation times and work weights. This paper uses the Dannenbring method with the aim of finding the optimal sequence of problems by considering the total production time (makespan) and the average Weigted Mean Flow Time (WMFT). Based on the results of the Dannenbring method, the results of flowshop scheduling are obtained with a total makespan of 75 hours and the WMFT value is 28, 87 hours.
Źródło:
World Scientific News; 2019, 127, 3; 212-224
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Flowshop scheduling with respect to transport time, break-time and weight of jobs using Nawaz, Enscor and Ham (NEH) methods
Autorzy:
Bahari, Muhammad Faudzi
Wulan, Elis Ratna
Huda, Arief Fatchul
Supian, Sudradjat
Subiyanto, Subiyanto
Powiązania:
https://bibliotekanauki.pl/articles/1177485.pdf
Data publikacji:
2018
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Flowshop
Makespan
NEH
Scheduling
Weighted Mean Flow Time
Opis:
This research discusses a production scheduling by using flowshop type production scheduling with respect to transportation time, break-time and weight of jobs. The data used are four job scheduling on three machines. In addition, there is inter-machine transport time. The method was used in this research is NEH Method. Based on the results, the NEH method obtained a makespan value of 56 hours with a weighted mean flow time of 34.07 hours.
Źródło:
World Scientific News; 2018, 102; 180-187
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Management of mass customized orders using flexible schedules to minimize delivery times
Zarządzanie masowo spersonalizowanymi zamówieniami przy wykorzystaniu elastycznych harmonogramów w celu zmniejszenia czasu dostawy
Autorzy:
Pandian, R. S.
Soltysova, Z.
Powiązania:
https://bibliotekanauki.pl/articles/405720.pdf
Data publikacji:
2018
Wydawca:
Politechnika Częstochowska
Tematy:
makespan
mass customization
scheduling
batch sizing
masowa personalizacja
planowanie
wielkość partii
Opis:
The goal of mass customization is to make the products and / or services to satisfy individual customer who makes the order with a specific design for their needs. In real situation it is not so easy deal to meet individual design and to satisfy each customer separately; there is a need to accustom such environment to fulfill the market demand. In such situation, the decision makers are to ensure that they are following flexibility while taking orders and also dispatching them to the customers. One such idea is being developed in this research work. The main aim of this research work is to offer the procedure; flexible mass customization (FLMACUS) to make flexible schedules that meets the customer requirements. A simple heuristics is used to develop the procedure and Gantt charts are used for accommodating the jobs for meeting specific due dates. In this paper batch type Original Equipment Manufacturers (OEMs) are considered for our study purpose. The results from Gantt charts in various categories are depicted. Such types of Gantt charts are hardly found in earlier studies and the results show that this procedure (FLMACUS) is promising in nature to meet customer demands and due dates in a mass customized environment.
Celem masowej personalizacji jest sprawienie, aby produkty i / lub usługi satysfakcjonowały indywidualnego klienta, który dokonuje zamówienia zgodnego z konkretnym projektem odpowiadającego jego potrzebom. W rzeczywistej sytuacji nie jest łatwo znaleźć indywidualny projekt i zadowolić każdego klienta osobno; istnieje potrzeba przystosowania takiego środowiska do zaspokojenia popytu na rynku. W takiej sytuacji decydenci muszą upewnić się, że działają elastycznie przy przyjmowaniu zamówień i wysyłaniu ich do klientów. Taka koncepcja rozwinięta została w niniejszej pracy badawczej. Głównym celem badania jest zaproponowanie procedury; elastyczną masową personalizację (FLMACUS) do tworzenia elastycznych harmonogramów spełniających wymagania klientów. Do opracowania procedury wykorzystano prostą heurystykę, natomiast do dostosowania zadań do spełnienia określonych terminów posłużyły wykresy Gantta. W artykule do celów badawczych wzięto pod uwagę Producentów Oryginalnego Sprzętu (OEM). W kolejnej części artykułu przedstawiono wyniki z wykresów Gantta w różnych kategoriach. Tego typu wykresy Gantta prawie nie występują we wcześniejszych badaniach, a wyniki pokazują, że ta procedura (FLMACUS) ma charakter obiecujący, aby sprostać wymaganiom klientów i terminom w masowo dostosowywanym środowisku.
Źródło:
Polish Journal of Management Studies; 2018, 18, 1; 252-261
2081-7452
Pojawia się w:
Polish Journal of Management Studies
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Comparative simulation study of production scheduling in the hybrid and the parallel flow
Autorzy:
Varela, M. L. R.
Trojanowska, J.
Carmo-Silva, S.
Costa, N. M. L.
Machado, J.
Powiązania:
https://bibliotekanauki.pl/articles/407017.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
approach for supporting manufacturing scheduling decision making
heuristics
hybrid flow shop
parallel flow shops
makespan
Opis:
Scheduling is one of the most important decisions in production control. An approach is proposed for supporting users to solve scheduling problems, by choosing the combination of physical manufacturing system configuration and the material handling system settings. The approach considers two alternative manufacturing scheduling configurations in a two stage product oriented manufacturing system, exploring the hybrid flow shop (HFS) and the parallel flow shop (PFS) environments. For illustrating the application of the proposed approach an industrial case from the automotive components industry is studied. The main aim of this research to compare results of study of production scheduling in the hybrid and the parallel flow, taking into account the makespan minimization criterion. Thus the HFS and the PFS performance is compared and analyzed, mainly in terms of the makespan, as the transportation times vary. The study shows that the performance HFS is clearly better when the work stations’ processing times are unbalanced, either in nature or as a consequence of the addition of transport times just to one of the work station processing time but loses advantage, becoming worse than the performance of the PFS configuration when the work stations’ processing times are balanced, either in nature or as a consequence of the addition of transport times added on the work stations’ processing times. This means that physical layout configurations along with the way transport time are including the work stations’ processing times should be carefully taken into consideration due to its influence on the performance reached by both HFS and PFS configurations.
Źródło:
Management and Production Engineering Review; 2017, 8, 2; 69-80
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Insertion Algorithms with Justification for Solving the Resource-Constrained Project Scheduling
Autorzy:
Klimek, M.
Łebkowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/375927.pdf
Data publikacji:
2016
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
insertion algorithms
resource - constrained project scheduling problem
makespan minimisation
justification
forward scheduling
priority rules
Opis:
The paper presents the resource-constrained project scheduling problem with the makespan minimization criterion. To solve the problem, the authors propose insertion algorithms that generate schedules with the use of forward serial and parallel decoding procedures. Schedules are improved with the use of the double justification by the extremes technique (first right and then left justification). The efficiency of the procedures proposed is tested on standard test problems from the PSPLIB library.
Źródło:
Decision Making in Manufacturing and Services; 2016, 10, 1-2; 31-43
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
Autorzy:
Różycki, R.
Waligóra, G.
Węglarz, J.
Powiązania:
https://bibliotekanauki.pl/articles/330888.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
machine scheduling
preemptable jobs
continuous resource
makespan
mathematical programming
szeregowanie zadań
zasób ciągły
programowanie matematyczne
Opis:
In this work we consider a problem of scheduling preemptable, independent jobs, characterized by the fact that their processing speeds depend on the amounts of a continuous, renewable resource allocated to jobs at a time. Jobs are scheduled on parallel, identical machines, with the criterion of minimization of the schedule length. Since two categories of resources occur in the problem: discrete (set of machines) and continuous, it is generally called a discrete-continuous scheduling problem. The model studied in this paper allows the total available amount of the continuous resource to vary over time, which is a practically important generalization that has not been considered yet for discrete-continuous scheduling problems. For this model we give some properties of optimal schedules on a basis of which we propose a general methodology for solving the considered class of problems. The methodology uses a two-phase approach in which, firstly, an assignment of machines to jobs is defined and, secondly, for this assignment an optimal continuous resource allocation is found by solving an appropriate mathematical programming problem. In the approach various cases are considered, following from assumptions made on the form of the processing speed functions of jobs. For each case an iterative algorithm is designed, leading to an optimal solution in a finite number of steps.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 3; 693-706
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scheduling arbitrary number of malleable tasks on multiprocessor systems
Autorzy:
Barketau, M. S.
Kovalyov, M. Y.
Węglarz, J.
Machowiak, M.
Powiązania:
https://bibliotekanauki.pl/articles/202097.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
multi-processor scheduling
malleable tasks
makespan
Opis:
The problem of scheduling n tasks in a multiprocessor system with m processors to minimize the makespan is studied. Tasks are malleable, which means that a task can be executed by several processors at a time, its processing speed depends on the number of allocated processors, and a set of processors allocated to the same task can change over time. The processing speed of a task is a strictly increasing function of the number of processors allocated to this task. The earlier studies considered the case n ≤ m. This paper presents results for arbitrary n and m including characterizations of a feasible domain and an optimal solution, polynomial time algorithms for strictly increasing convex and concave processing speed functions, and a combinatorial exponential algorithm for arbitrary strictly increasing functions.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 2; 255-261
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Effective Design of the Simulated Annealing Algorithm for the Flowshop Problem with Minimum Makespan Criterion
Autorzy:
Hurkała, J.
Hurkała, A.
Powiązania:
https://bibliotekanauki.pl/articles/309187.pdf
Data publikacji:
2012
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
flowshop
heuristics
makespan
simulated annealing
Opis:
In this paper we address the n-job, m-machine flowshop scheduling problem with minimum completion time (makespan) as the performance criterion. We describe an efficient design of the Simulated Annealing algorithm for solving approximately this NP-hard problem. The main difficulty in implementing the algorithm is no apparent analogy for the temperature as a parameter in the flowshop combinatorial problem. Moreover, the quality of solutions is dependent on the choice of cooling scheme, initial temperature, number of iterations, and the temperature decrease rate at each step as the annealing proceeds. We propose how to choose the values of all the aforementioned parameters, as well as the Boltzmann factor for the Metropolis scheme. Three perturbation techniques are tested and their impact on the solutions quality is analyzed. We also compare a heuristic and randomly generated solutions as initial seeds to the annealing optimization process. Computational experiments indicate that the proposed design provides very good results - the quality of solutions of the Simulated Annealing algorithm is favorably compared with two different heuristics.
Źródło:
Journal of Telecommunications and Information Technology; 2012, 2; 92-98
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Problem-Independent Approach to Multiprocessor Dependent Task Scheduling
Autorzy:
Król, D.
Zydek, D.
Koszałka, L.
Powiązania:
https://bibliotekanauki.pl/articles/226364.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
tasks scheduling
DAG
genetic algorithm
tabu search
makespan
Opis:
This paper concerns Directed Acyclic Graph task scheduling on parallel executors. The problem is solved using two new implementations of Tabu Search and genetic algorithm presented in the paper. A new approach to solution coding is also introduced and implemented in both metaheuristics algorithms. Results given by the algorithms are compared to those generated by greedy LPT and SS-FF algorithms; and HAR algorithm. The analysis of the obtained results of multistage simulation experiments confirms the conclusion that the proposed and implemented algorithms are characterized by very good performance and characteristics.
Źródło:
International Journal of Electronics and Telecommunications; 2012, 58, 4; 369-379
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 18

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