Informacja

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

Wyszukujesz frazę "flowshop scheduling" wg kryterium: Temat


Wyświetlanie 1-8 z 8
Tytuł:
Method of rescheduling for hybrid production lines with intermediate buffers
Autorzy:
Magiera, Marek
Powiązania:
https://bibliotekanauki.pl/articles/229789.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
rescheduling
scheduling
heuristic
flowshop
hybrid production line
buffer management
Opis:
A method of creating production schedules regarding production lines with parallel machines is presented. The production line setup provides for intermediate buffers located between individual stages. The method mostly concerns situations when part of the production machines is unavailable for performance of operations and it becomes necessary to modify the original schedule, the consequence of which is the need to build a new schedule. The cost criterion was taken into account, as the schedule is created with the lowest possible costs regarding untimely completion of products (e.g. fines for delayed product completion). The proposed method is relaxing heuristics, thanks to which scheduling is performed in a relatively short time. This was confirmed by the presented results of computational experiments. These experiments were carried out for the rescheduling of machine parts production.
Źródło:
Archives of Control Sciences; 2020, 30, 2; 213-231
1230-2384
Pojawia się w:
Archives of Control Sciences
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ł:
Algorithms Using List Scheduling and Greedy Strategies for Scheduling in the Flowshop with Resource Constraints
Autorzy:
Figielska, E.
Powiązania:
https://bibliotekanauki.pl/articles/91270.pdf
Data publikacji:
2014
Wydawca:
Warszawska Wyższa Szkoła Informatyki
Tematy:
flowshop
parallel machines
resource constraints
scheduling
heuristic
Opis:
The paper addresses the problem of scheduling in the two-stage flowshop with parallel unrelated machines and renewable resource constraints. The objective is minimization of makespan. The problem is NP-hard. Fast heuristic algorithms using list scheduling and greedy strategies are proposed. For evaluation of the performance of the algorithms computational experiments are performed on randomly generated test problems, and results are reported.
Źródło:
Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki; 2014, 8, 11; 29-39
1896-396X
2082-8349
Pojawia się w:
Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A relaxation heuristic for scheduling flowshops with intermediate buffers
Autorzy:
Magiera, M.
Powiązania:
https://bibliotekanauki.pl/articles/200698.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
scheduling
heuristic
linear programming
production planning
decision making
flowshop
Opis:
The paper presents a two-level relaxation heuristic for production planning for multistage flowshop systems with intermediate buffers. The method concerns unidirectional multistage systems where tasks with respect to many various types of products are performed simultaneously. The fixed and the alternative production routes are regarded in the method. The top-level is a stage loading, i.e., allocation of tasks among the stages. The base-level is a task scheduling - allocation of tasks among the stations. The linear mathematical models of mixed integer programming are used in the method. The time criterion is used in the minimization functions - the minimal schedule is fixed. The condition that variables are to be integers has been ignored in the heuristic. The relaxed heuristic developed in such a manner enables obtaining good results in a very short time. This paper discusses the multilevel approach as the developed production scheduling method serves the purpose of solving relatively large problems. Results of computational experiments with the proposed heuristic method are presented.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2013, 61, 4; 929-942
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems
Autorzy:
Chung, Chia-Shin
Flynn, James
Rom, Walter
Staliński, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/475000.pdf
Data publikacji:
2012
Wydawca:
Fundacja Upowszechniająca Wiedzę i Naukę Cognitione
Tematy:
genetic algorithm
scheduling
permutation flowshop
tardiness
Opis:
The m-machine, n-job, permutation flowshop problem with the total tardiness objective is a common scheduling problem, known to be NP-hard. Branch and bound, the usual approach to finding an optimal solution, experiences difficulty when n exceeds 20. Here, we develop a genetic algorithm, GA, which can handle problems with larger n. We also undertake a numerical study comparing GA with an optimal branch and bound algorithm, and various heuristic algorithms including the well known NEH algorithm and a local search heuristic LH. Extensive computational experiments indicate that LH is an effective heuristic and GA can produce noticeable improvements over LH.
Źródło:
Journal of Entrepreneurship, Management and Innovation; 2012, 8, 2; 26-43
2299-7075
2299-7326
Pojawia się w:
Journal of Entrepreneurship, Management and Innovation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heuristic algorithms for preemptive scheduling in a Two-stage flowshop with unrelated parallel machines and 0-1 resource requirements
Autorzy:
Figielska, E.
Powiązania:
https://bibliotekanauki.pl/articles/969665.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
preemptive scheduling
flowshop
parallel unrelated machines
resource constraints
heuristics
Opis:
The paper considers the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines at the first stage and a single machine at the second stage. At the first stage, jobs use some additional renewable resources which are available in limited quantities. The resource requirements are of 0-1 type. The objective is minimization of the makespan. The problem is NP-hard. We develop heuristic algorithms which first solve the problem occurring at stage 1, and then find a final schedule in the flowshop. An extensive computational experiment shows that the proposed heuristic algorithms can be an efficient tool capable of finding good quality solutions.
Źródło:
Control and Cybernetics; 2009, 38, 3; 723-743
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A critical review of the newest biologically-inspired algorithms for the flowshop scheduling problem
Autorzy:
Duda, J.
Powiązania:
https://bibliotekanauki.pl/articles/1943277.pdf
Data publikacji:
2007
Wydawca:
Politechnika Gdańska
Tematy:
flowshop scheduling
metaheuristics
local search
hybrid algorithms
Opis:
The three most recent bio-inspired heuristics proposed in the OR literature for solving the flowshop scheduling problem are revised in the paper. All of these algorithms use local search procedures to improve solutions achieved by the main procedure. The author tries to asses the gains from hybridizing such heuristics with local search procedures. The achieved results confirm that simple local search algorithms can compete successfully with much complex hybrids.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2007, 11, 1-2; 7-19
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Three-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times
Autorzy:
Allahverdi, A.
Powiązania:
https://bibliotekanauki.pl/articles/375898.pdf
Data publikacji:
2007
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
scheduling
flowshop
dominance relations
bounded processing and setup times
Opis:
The three-machine flowshop scheduling problem to minimize total completion time is studied where setup times are treated as separate from processing times. Setup and processing times of all jobs on all machines are unknown variables before the actual occurrence of these times. The lower and upper bounds for setup and processing times of each job on each machine is the only information that is available. In such a scheduling environment, there may not exist a unique schedule that remains optimal for all possible realizations of setup and processing times. Therefore, it is desired to obtain a set of dominating schedules (which dominate all other schedules) if possible. The objective for such a scheduling environment is to reduce the size of dominating schedule set. We obtain global and local dominance relations for a three-machine flowshop scheduling problem. Furthermore, we illustrate the use of dominance relations by numerical examples and conduct computational experiments on randomly generated problems to measure the effectiveness of the developed dominance relations. The computational experiments show that the developed dominance relations are quite helpful in reducing the size of dominating schedules.
Źródło:
Decision Making in Manufacturing and Services; 2007, 1, 1-2; 5-23
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-8 z 8

    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