Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
In this paper, we address a new integration of column generation and Lagrangian relaxation for solving flowshop scheduling problems to minimize the total weighted tardiness. In the proposed method, initial columns are generated by using near-optimal dual solution using the Lagrange multipliers derived by Lagrangian relaxation method. After the generation of base columns, the column generation is executed...
It is studied that several constructive heuristics for solving the sequence dependent setup time flowshop problem with the objective of minimizing makespan. Three priority rules imbedded in the heuristics are tested and a tie-breaking strategy is examined. The experimental results on benchmarks show that the priority rules are helpful to improve the performance, especially for the instances in which...
This paper considers three machine flowshop scheduling problem with two agents. The jobs of first agent have two operations executed in the same order, on M1 and then on M2 respectively. According to the second agent, the jobs should be executed on M2 and then on M3. Thus, the second machine M2 has to be shared to perform all of jobs. The objective is to minimize at the same time the makespan of each...
The problem illustrated in this paper is a special type of scheduling problem found in a re-entrant flow shop where two of its processes has high tendency of exhibiting bottleneck characteristics. The processes scheduling resembles a four machine permutation re-entrant flow shop with the process routing of M1, M2, M3, M4, M3, M4 where M1 and M4 have high tendency of being the dominant machines. Due...
It is a common practice in the scheduling literature to focus on a given model and then, from there, a study is carried out. In this paper, we consider the problem of measuring the payoff one may expect from choosing one model instead of another one. In other words, given the same instance, we measure the distance between the optimal solution produced in one model and the optimal solution produced...
This paper deals with the multiobjective scheduling of a two stages reentrant hybrid flow shop. The system studied here is reentrant: jobs have to be processed more than once at each stage which is made of several identical parallel machines. Furthermore, the sequence is the same on each stage. In this study the two objectives are the minimization of both the maximum completion time and the sum of...
In this paper a lower bounding method for the flowshop sequence dependent groups scheduling problems by minimization of makespan criterion (Fm|fmls, Sijk, prmu|Cmax) is proposed. The performance of the proposed lower bound (LB) is compared with the available lower bounding methods in literature. In order to do this, the performance of the proposed LB and the one available in literature are compared...
This paper addresses to the scheduling in manufacturing cell environment with sequence dependent family setup times in a flow shop with respect to the makespan criterion. Since this is a NP-hard problem, we present an estimation of distribution algorithm as an evolutionary algorithm for solving it. In order to improve the quality of solution of our algorithm, we propose a hybridization with an iterated...
The two-machine no-wait flowshop problem with availability constraints and release dates is studied in this paper. We work under the assumption that each machine is unavailable during a time interval. The intervals overlap and are known in advance. Two heuristics based on Gilmore-Gomory and Cheng and Liu algorithms are proposed for this problem. An experimental study is conducted to evaluate the performance...
The problem considered in this research is the just-in-time scheduling of a manufacturing environment that is able to produce several different products. New jobs come randomly into the system, expected to become one of the products. Each job must go through multiple stages before it can be finished as a product. There are multiple machines at each stage, and the processing time of each product on...
In this paper, a mathematical programming model is established for hybrid flow-shop scheduling problem, with the minimum of the makespan as the objective function. Based on the particle swarm optimization algorithm, a distributed approach according to the process is presented to solve the global problem. Compared with the references, the experimental results indicate that the distributed approach...
The flexible flow shop refers to such a manufacturing environment in which jobs are to be processed through serial stages, with one or multiple machines available at each stage. It is usually a complex task when specific objective is demanded such as minimum cost, minimum time, etc. Static scheduling of such problems has been much researched, however, little efforts have been made on realtime scheduling...
In this paper we consider a scheduling problem where a set of jobs are simultaneously available for processing in a no-wait two-machine flowshop. All jobs are processed on both machines in batches. Batching machines can process several tasks per batch so that all tasks of the same batch start and complete together. The batch processing time for the first machine is equal to the maximal processing...
In recent years, hyper-heuristics have emerged as a new search methodology that is motivated by the goal of increasing the level of generality of meta-heuristics. In this paper, we aim at investigating the role of cooperative decision making in the selection process of low level heuristics. We propose a novel cooperative distributed hyper-heuristic framework. The cooperative distributed hyper-heuristic...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.