A HYBRID GENETIC-GRAVITATIONAL SEARCH ALGORITHM FOR A MULTI-OBJECTIVE FLOW SHOP SCHEDULING PROBLEM

The results show that the proposed algorithm is significantly better than the traditional dispatching rules and the rules allocation algorithm. The proposed algorithm not only improved the quality of the schedule in multi-objective problems but also maintained the advantages of traditional dispatchi[r]

This heuristic is designed for implementation in a static maintenance scheduling problem (with unequal release dates, processing times and resource skills), while minimizing objective functions aforementioned.

TRANG 1 MULTI-OBJECTIVE GENETIC ALGORITHMS: PROBLEM DIFFICULTIES AND CONSTRUCTION OF TEST PROBLEMS Kalyanmoy Deb Kanpur Genetic Algorithms Laboratory KanGAL Department of Mechanical Engi[r]

TRANG 8 NOMENCLATURE δ variance µ mean ν the bitrate of the bus τi message i τbit the time to transmit a bit on the bus Bi the worst case blocking time of message τi Ci computation time [r]

1. MO" DAU
H a u h et c a c bo di e u kh i e n dan g 5U:dun g, n h ir ca i t him g r o , cu a 5 6 tru" u t", de u d u'a t r e n rn o hin h lu o n g tinh - voi g ii t hie t hru hrong da u v ao kh o n g t h ay d6i t h eo t h a i gi a n [1, 3 , 5,[r]

This type of configuration includes assembly lines and the chemical, electronic, food, and metallurgical industries, among others. Scheduling has been mostly investigated for the deterministic cases, in which all parameters are known in advance and do not vary over time. Nevertheless, in real-world[r]

much related research work (Nariman-zadeh et al., 2005; Atashkari et al., 2005; Coello Coello & Christiansen, 2000; Coello Coello et al., 2002; Pareto, 1896; Osyezka, 1985; Toffolo & Benini, 2002; Deb et al., 2002; Coello Coello & Becerra, 2003; Nariman-zadeh et al., 2005). Consequen[r]

In this research, we put the development of a no-wait flow-shop scheduling model alongside with the effect of learning into consideration to minimize the cost of consumption of resources.

The purpose of this study is to solve a complex multi-product four-layer capacitated locationrouting problem (LRP) in which two specific constraints are taken into account: 1) plants have limited production capacity, and 2) central depots have limited capacity for storing and transshipping products.

This substantially reduces the computation effort and numerical complexity. Computational results reveal that Jaya algorithm is efficient in most cases and has considerable potential for permutation flow-shop scheduling problems.

Hence, an approach to automatically determine the optimal combination of the ACS parameters is desirable for a given traffic routing problem. It is more significant in the practical application of the ACS algorithm for developing a[r]

To improve the application of the multi-objective particle swarm optimization with fitness sharing MO-PSO for the FRBC design method proposed in [33], this paper represents an applicatio[r]

6.1.1 Introduction to Simulated Annealing
A combinatorial optimization problem strives to find the best or optimal solution, among a finite or infinite number of solutions. A wide variety of combinatorial prob- lems have emerged from different areas such as physical sci[r]

The proposed approach attempts to minimize total costs with reference to inventory levels, labor levels, overtime, subcontracting and backordering levels, and labor, machine and warehouse capacity. Here several genetic algorithm parameters are considered for solving NP-hard problem (APP problem) and[r]

The hybrid method based on genetic _ _algorithm and ant colony system GACS _ In traffic routing problem, heuristic information of transportation environment is highly significant to help[r]

This paper deals with Flow-shop Sequence-Dependent Group Scheduling and worker assignment problem. Flow-shop allows the process of a set of families of products applying the group technology concept to reduce setup costs, lead times, and work-in-process inventory costs. The worker assignment problem[r]

The competition manufacturing companies face has driven the development of novel and efficient methods that enhance the decision making process. In this work, a specific flow shop scheduling problem of practical interest in the industry is presented and formalized using a mathematical programming mo[r]

This paper presents a heuristic method to minimize makespan for different jobs in a job shop scheduling. The proposed model is based on a constructive procedure to obtain good quality schedules, very quickly. The performance of the proposed model of this paper is examined on standard benchmarks from[r]

Although parallel-machine scheduling has been studied extensively, not much research has considered the case in which a setup for dies is incurred if there is a switch from processing one type of job to another type, the number of dies of each type is limited, the proce[r]

Active schedules and a new genetic algorithm for solving job shop scheduling problein are presented in this paper. In the proposed method, a chromosome representation [r]