[PDF] Top 20 Using a Modified Simulated Annealing Algorithm to Minimize Makespan in a Permutation Flow-shop Scheduling Problem with Job Deterioration

... our problem, we employed the concept of variable neighborhood search (VNS) within our SA ...some algorithm iterations, another NSS is used. In this problem, if the NSS i does not improve the best ... See full document

... a flow shop that minimized four combinations of objectives such as makespan, maximum tardiness, total tardiness and flow ...heuristic algorithm for a flow shop with m ... See full document

... advantage. Flow shop scheduling problem with order acceptance decision, the objective function of which is to maximize the total net profit of the accepted orders, has become the epicenter of ... See full document

... and job-based ...machine-based, job-based and non interference bounds, and elimination strategies in a comparative study along with an improved solution ...bound algorithm for scheduling to ... See full document

... A flow shop with no-wait schedules jobs continuously through all machines without any wait at consecutive ...This scheduling problem is combinatorial optimization problem and observed ... See full document

... machines scheduling problem, consider the machine shop of an automobile ...to minimize the makespan, this practical reality corresponds to single machine scheduling ... See full document

... The job-shop scheduling is one of the most significant industrial behaviours, particularly in manufacturing ...the permutation flow shop sequencing problem with the ... See full document

... minimizing makespan, where set-up, processing and removal times are ...for permutation flow shop scheduling problem including setup times with objective function of weighted sum ... See full document

... hybrid algorithm has been proposed to solve bi-objective permutation flow shop scheduling prob- ...of flow shop scheduling problem considered in this work is ... See full document

... machines scheduling problems with sequence- dependent setup times and precedence constraints to minimize the number of tardy jobs and total completion time of all ...in scheduling problems, are an ... See full document

... them using 540 instances of different ...on job insertion or job interchanges were those that presented the best ...that simulated annealing outperformed the other ...to minimize ... See full document

... The algorithm recently proposed by Gupta and Chauhan (2015) performs better than many simple heuristics like Palmer, CDS and RA algorithms; but, could not perform better than the NEH ...on Simulated ... See full document

... genetic algorithm for job shop scheduling problem with fuzzy processing times and fuzzy due ...to minimize the maximum fuzzy completion ...assembly job shop ... See full document

... the makespan. In this study, we will describe on how to minimize the makespan for the n-jobs and m-machines problem, which is classified as combinatorial optimization ...NP-hard problem ... See full document

... the problem of two-machine flow shop scheduling to minimize total energy costs under time-of-use tariffs is ...the problem and the other one for a situation when inserting ... See full document

... This algorithm is modified as a new approach to solve ...the modified GT-GA is as well as the existing GT-GA and hence the modified GT-GA can be chosen as one of our alternative to solve JSSP ... See full document

... genetic algorithm (GA), are an effective type of meta-heuristic ...GA using opposition-based ...a modified neighbor search mutation with opposite inverse ... See full document

... The JOB-SHOP scheduling problem (JSSP) is a very important practical problem in both fields of production management and combinatorial ...because scheduling problem varies ... See full document

... The algorithm is coded in C language and run on a Pentium IV, ...benchmark problem instances are considered: 32 instances denoted as (LA01−LA32) presented by Lawrence (1984), 3 instances (FT6, FT10, FT20) ... See full document

... The algorithm was tested to verify different scenarios, using different Pareto sets with different combinations of ...the algorithm performed better when only one swarm was used for all three ... See full document