0957-4174/$ see front matter 2010 Elsevier Ltd. A doi:10.1016/j.eswa.2010.08.145 ⇑ Corresponding author. E-mail address: [email protected] (L. Gao In this paper, we proposed an effective genetic algorithm for solving the flexible job-shop scheduling problem (FJSP) to minimize makespan time. In the proposed algorithm, Global Selection (GS) and Local Selection (LS) are designed to generat...

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

This paper considers a scheduling problem in flexible flow shops environment with the aim of minimizing two important criteria including makespan and cumulative tardiness of jobs. Since the proposed problem is known as an Np-hard problem in literature, we have to develop a meta-heuristic to solve it. We considered general structure of Genetic Algorithm (GA) and developed a new version of that b...

Scheduling in a job-shop system is a challenging task, however it costly and time consuming. Successful implementation of automated manufacturing system highly depends on effective utilization of resource. Efficient scheduling algorithm for alternate process plan may increase the throughput rate, utilization of machine and guarantee a reasonable return of investment. In this paper, the objectiv...

This paper discusses design and comparison of Simulated Annealing Algorithm and Greedy Randomized Adaptive Search Procedure (GRASP) to minimize the makespan in scheduling n single operation independent jobs on m unrelated parallel machines. This problem of minimizing the makespan in single machine scheduling problem with uniform parallel machines is NP hard. Hence, heuristic development for suc...

Scheduling is one of the core steps to efficiently exploit the capabilities of heterogeneous distributed computing systems and represents an NP-complete problem. Therefore, using meta-heuristic algorithms is a suitable approach in order to cope with its difficulty. In many meta-heuristic algorithms, generating individuals in the initial step has an important effect on the convergence behavior o...

— Flexible Job Shop scheduling problem (FJSSP) is an important scheduling problem which has received considerable importance in the manufacturing domain. In this paper a genetic algorithm (GA) based scheduler is presented for flexible job shop problem to minimise makespan. The proposed approach implements a domain independent GA to solve this important class of problem. The scheduler is impleme...

In terms of characteristics of flexible job-shop scheduling problem, the complementary constraint models, including priority among different jobs and parent-child relations of relevant jobs, are established based on two objective function of minimizing makespan for all jobs and the sum of standard deviation of processing workload for all working centers. Aiming at the above model, a hybrid gene...