This paper proposes a modified iterated greedy(IG) algorithm to deal with FJSP problem in order to provide a simpler metaheuristic, which is easier to code and to reproduce than some other much more complex met
This algorithm was first proposed by Ruiz and Stützle [20] to solve traditional permutation flow shop scheduling problems. The traditional IG consists of two distinct iterative phases; destructing some a part of the solution, and reconstructing this part by some greedy techniques including local se...
Chemical-reaction optimization for flexible job-shop scheduling problems with maintenance activity Applied Soft Computing, 12 (2012), pp. 2896-2912 Google Scholar 25 Xiaofeng Li, Zhao Hai Greedy Algorithm Solution of Flexible Flow Shop Scheduling Problem IJCSNS International Journal of Computer Science ...
The flexible job shop scheduling problem with parallel batch processing operation (FJSP_PBPO) in this study is motivated by real-world scenarios observed in electronic product testing workshops. This research aims to tackle the deficiency of effective me
Marzouki B, Driss OB, Ghédira K (2017) Multi agent model based on chemical reaction optimization with greedy algorithm for flexible job shop scheduling problem. Procedia Computer Science 112:81–90. https://doi.org/10.1016/j.procs.2017.08.174 Article MATH Google Scholar Download references ...
Wan and Yan discussed assembly job shop scheduling problem using insertion search algorithm. Operations with tardiness and earliness will move to left or right for optimizing the schedule. The objective of this study was minimising the weighted sum of earliness and tardiness penalties [9]. Alexnder...
job-shopschedulingproblem：作业车间调度问题 Multistage-based genetic algorithm for flexible job-shop scheduling problem Haipeng Zhang, and Mitsuo Gen Graduate School of Information, Production & Systems, Waseda University Wakamatsu-ku, Kitakyushu 808-0135, JAPAN Email:***.jp,*** Abstract Flexible Job-...
greedy algorithm,random strategy is generated as the initial strategy,and the action with the maximum information gain is selected to expand it to optimize the exploration ability of Actor-Critic algorithm.Through validation of the trained policy model on multiple public test data sets and comparison...
[3] proposed a multi-objective mathematical programming model and several algorithms for a single CNC machine scheduling problem with the goals of reducing both energy consumption and total completion time. Mouzon and Yildirim [15] applied a greedy randomized adaptive search algorithm to a single-...
proposed a modified iterated greedy (IG) algorithm, which includes two phases, and each phase is used to solve a subproblem of the FJSP [14]. From the outlined literature on FJSPs, it is evident that many meta-heuristics have been utilized to solve the complex optimization scheduling problem...