نتایج جستجو برای: flexible job shop scheduling local search makespan meta heuristics teaching

تعداد نتایج: 1335570  

2001
Yasuhiro Tsujimura Yuichiro Mafune Mitsuo Gen

In our recent research, we showed results of the comparative study on effects of using several kinds of scheduling evaluation criteria as the fitness function of a genetic algorithm for job-shop scheduling. From these results, we obtained that the idle time criterion sometimes can provide a good makespan-minimizing schedule for a job-shop scheduling problem. In this paper, according to the abov...

Journal: :Appl. Soft Comput. 2012
Junqing Li Quan-Ke Pan

This paper proposes an effective discrete chemical-reaction optimization (DCRO) algorithm for solving the flexible job-shop scheduling problems with maintenance activity constraints. Three minimization objectives—the maximum completion time (makespan), the total workload of machines and the workload of the critical machine are considered simultaneously. In the proposed algorithm, each solution ...

2016
R. Rajkumar

The job shop scheduling problem (JSSP) has attracted much attention in the field of both information sciences and operations research. This paper considers the permutation Job shop scheduling problem with the objective of minimizing make span. Artificial Bee Colony algorithm (ABC) is one of the search heuristics used to solve global optimization problems in complex search spaces. It is observed...

Journal: :IJGC 2011
V. Mahesh L. Siva Rama Krishna Sandeep Dulluri C. S. P. Rao

This paper discusses the scheduling of precedence-related jobs non-preemptively in a job shop environment with an objective of minimizing the makespan. Due to the NP-hard nature of the scheduling problems, it is usually difficult to find an exact optimal schedule and hence one should rely on finding a near to optimal solution. This paper proposes a computationally effective powers-of-two heuris...

2014
LEILA ASADZADEH

Job shop scheduling problems play an important role in both manufacturing systems and industrial process for improving the utilization of resources, and therefore it is crucial to develop efficient scheduling technologies. The Job shop scheduling problem, one of the best known production scheduling problems, has been proved to be NP-hard. In this paper, we present a parallel and agent-based loc...

Journal: :IEEE Access 2022

Aiming at the coupling of energy consumption and completion time in flexible job-shop scheduling, this paper took makespan as optimization objectives, established a scheduling model, proposed strategy based on improved genetic algorithm. Firstly, hybrid initialization method global minimum selection workload is introduced to generate initial population, scale population expanded increase divers...

2012
P. D. D. Dominic Ahmad Kamil P. Parthiban M. Punniyamoorthy

The job shop problem is among the class of NPhard combinatorial problems. This Research paper addresses the problem of static job shop scheduling on the job-based representation and the rule based representations. The popular search techniques like the genetic algorithm and simulated annealing are used for the determination of the objectives like minimizations of the makespan time and mean flow...

Journal: :International Journal of Low-carbon Technologies 2021

Abstract In order to further reduce the carbon emission of manufacturing process in flexible job shop, a multi-objective integrated optimization model job-shop scheduling (FJSP) is proposed. A mathematics built this paper minimize makespan, total workload machines and emissions optimize method each machine characteristic, sequence allocation. Considering many parameters are interactional be opt...

Journal: :journal of advances in computer research 2013
behnam barzegar homayun motameni

job shop scheduling problem has significant importance in many researchingfields such as production management and programming and also combinedoptimizing. job shop scheduling problem includes two sub-problems: machineassignment and sequence operation performing. in this paper combination ofparticle swarm optimization algorithm (pso) and gravitational search algorithm(gsa) have been presented f...

Journal: :Int. J. Computer Integrated Manufacturing 2011
Rasoul Shafaei Meysam Rabiee M. Mirzaeyan

This article may be used for research, teaching and private study purposes. Any substantial or systematic reproduction, redistribution , reselling , loan, sub-licensing, systematic supply or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید