968 Hits in 4.5 sec

Comparative Analysis of Metaheuristic Approaches for Makespan Minimization for No Wait Flow Shop Scheduling Problem

Laxmi A. Bewoor, V. Chandra Prakash, Sagar U. Sapkal
2017 International Journal of Electrical and Computer Engineering (IJECE)  
This paper provides comparative analysis of various metaheuristic approaches for m-machine no wait flow shop scheduling (NWFSS) problem with makespan as an optimality criterion.  ...  The objective is to find out the scheduling sequence of jobs to minimize total completion time. In order to meet the objective criterion, existing metaheuristic techniques viz.  ...  The main objective of this paper is to compare effectiveness of some metaheuristic techniques for minimizing makespan for NWFSS problem.  ... 
doi:10.11591/ijece.v7i1.pp417-423 fatcat:hqnuucsdvfbajmk2253le2obfy

Application of Genetic Algorithm on Job Shop Scheduling Problem to Minimise Makespan

2016 International Journal of Science and Research (IJSR)  
Job shop scheduling problem (JSSP) is a well known combinatorial optimization problem with NP hard difficulty.  ...  Job shop scheduling (JSS) is the efficient allocation of shared resources (M) to competing jobs (J) such that a specific optimization criterion is satisfied. The complexity of JSS is (J!)  ...  Acknowledgment The support and guidance of my guide Prof. Mrs. L.A. Bewoor is highly appreciated.  ... 
doi:10.21275/v5i6.nov164660 fatcat:hcn6oe3kcbbttnyyi5jidlywty

Improved Genetic Algorithm Approach based on New Virtual Crossover Operators for Dynamic Job Shop Scheduling

Kaouther Ben Ali, Achraf Jabeur Telmoudi, Said Gattoufi
2020 IEEE Access  
The present study considers a dynamic job shop environment to minimize the makespan.  ...  Table 3 and Fig.10 represent the different results of the makespan minimization for 26 Dynamic JSSP.  ... 
doi:10.1109/access.2020.3040345 fatcat:ufeh74vxcjfgriqk46e5ugc6cy

Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: A systematic literature review

Harpreet Singh, Jaspreet Singh Oberoi, Doordarshi Singh
2020 Reserche operationelle  
Flow shop scheduling is a type of scheduling where sequence follows for each job on a set of machines for processing.  ...  The flexible flow shop scheduling problems with no-wait have mainly addressed for flow optimization on the shop floor in manufacturing, processing, and allied industries.  ...  INTRODUCTION The multi-objective flow shop scheduling problem is the type of production scheduling problems.  ... 
doi:10.1051/ro/2020055 fatcat:t3g52lg2jzghfcljyig6ruu25a

Scheduling with Maintenance Technique in Dynamic Job Shop System including Machine Breakdowns

Kaouther Ben Ali
2022 Medicon Engineering Themes  
This paper is addressed to study the problem of job shop in dynamic environment with the risk of random machine breakdown. It is considered a NP Hard optimization problem.  ...  Machine scheduling is concerned with the problem of optimally scheduling available machines.  ...  Her research interets include almost the fields of Operation Reasearch, Combinatorial Optimization problems and Artificial Intelligence for real world applications. She is an IEEE fellow student  ... 
doi:10.55162/mcet.02.019 fatcat:mcwcnoa6yffudjnrvsv5yy2pj4

Promoting green internet computing throughout simulation-optimization scheduling algorithms

Guillem Cabrera, Hebert Perez-Roses, Angel A. Juan, Joan M. Marques, Javier Faulin
2013 2013 Winter Simulations Conference (WSC)  
The paper discusses the relevance of considering environmental factors in modern computing and then describes how simulation can be combined with scheduling metaheuristics in order to reduce the expected  ...  This, in turn, allows for a reduction in average energy consumption, which makes the computing facility more efficient from an environmental perspective.  ...  -also with the objective of minimizing the expected makespan.  ... 
doi:10.1109/wsc.2013.6721571 dblp:conf/wsc/CabreraPJMF13 fatcat:w3ic7s3hqrbbnphpwmaga2cxse

A high performing metaheuristic for job shop scheduling with sequence-dependent setup times

B. Naderi, S.M.T. Fatemi Ghomi, M. Aminnayeri
2010 Applied Soft Computing  
It can simultaneously investigate several factors and This paper investigates scheduling job shop problems with sequence-dependent setup times under minimization of makespan.  ...  Vinod and Sridharan [34] address dynamic SDST JSS and develop a discrete event simulation model of the job shop.  ... 
doi:10.1016/j.asoc.2009.08.039 fatcat:52qvus5qrjhgfkykpar43ethmq

Comparisons of bi-objective genetic algorithms for hybrid flowshop scheduling with sequence-dependent setup times

S.M. Mousavi, M. Zandieh, M. Amiri
2012 International Journal of Production Research  
Furthermore, based on the review of the existing papers, the need for future research is recognized.  ...  Among them, Sequence Dependent Setup Times-Multi-Objective Hybrid Flowshop Scheduling Problem (SDST-MOHFSP) has been an intensifying attention of researchers and practitioners in the last three decades  ...  Maboudian and Shafaei [144] have addressed a two-stage SDST-MOHFFSP assembly flow shop scheduling problem with the objectives of minimizing makespan and maximum tardiness.  ... 
doi:10.1080/00207543.2010.543178 fatcat:ch5qv36nyjedvojvytrmjh6wpu

Job-shop Scheduling Incorporating Dynamic and Flexible Facility Layout Planning

Ryota Kamoshida, Intelligent Information Research Department, Hitachi, Ltd., Tokyo, Japan
2019 Journal of Industrial and Intelligent Information  
The makespan of the schedule is minimized by a tabu search algorithm.  ...  A method for solving the job-shop scheduling problem (JSSP) integrated with dynamic and flexible facility layout planning (FLP) is proposed.  ...  The objective of the FLPIJSSP is to minimize the makespan (i.e., maximum time to complete all jobs) of the schedule.  ... 
doi:10.18178/jiii.7.1.12-17 fatcat:d3crakphjnej5joqux6jtvcory

Metaheuristics for two-stage flow-shop assembly problem with a truncation learning function

Chin-Chia Wu, Xingong Zhang, Ameni Azzouz, Wei-Lun Shen, Shuenn-Ren Cheng, Peng-Hsiang Hsu, Win-Chin Lin
2020 Figshare  
To overcome this limitation, this study investigates a two-stage three-machine flow-shop assembly problem with a truncation learning function where the makespan criterion (completion of the last job) is  ...  However, the truncation function is very limited in the two-stage flow-shop assembly scheduling settings.  ...  S2S3S4S5S6 Average AEP obtained under variation in Type for small-n scheduling Average AEP obtained under variation in τ for small-n scheduling Average RPD obtained under variation in n for large-n scheduling  ... 
doi:10.6084/m9.figshare.12263807.v1 fatcat:ljgia3uqufe2blzoukofrrgqa4

A Survey of Solving Approaches for Multiple Objective Flexible Job Shop Scheduling Problems

Krasimira Genova, Leoneed Kirilov, Vassil Guliashki
2015 Cybernetics and Information Technologies  
Usually hybrid metaheuristic algorithms are proposed for large dimensional real life problems and they outlay the tendency for the future developments of efficient solution approaches for multiple objective  ...  Many real life scheduling problems can be formulated as Flexible Job Shop Scheduling Problems (FJSSPs) which simultaneously optimize several conflicting criteria.  ...  the purposes of development of software tool for generating efficient schedules by an innovative method for multiple objective optimization in discrete manufacturing within the scope of small and medium  ... 
doi:10.1515/cait-2015-0025 fatcat:aqgxekvzpbd4rf6uoyta655xi4

Bi-Objective Dynamic Multiprocessor Open Shop Scheduling: An Exact Algorithm

Tamer F. Abdelmaguid
2020 Algorithms  
In this paper, a dynamic case of the multiprocessor open shop scheduling problem is addressed.  ...  Two objectives are considered simultaneously—the minimization of the makespan and the minimization of the mean weighted flow time.  ...  In the scheduling literature, comparisons of the different MILP models are provided for the flow shop scheduling problem [31] , for the OSP [32] , for the flexible job shop scheduling [33] and for  ... 
doi:10.3390/a13030074 fatcat:sq7qdvxvwbaw7b3xqmm3wuzhw4

An Ant Colony System Algorithm for the Hybrid Flow-Shop Scheduling Problem

Safa Khalouli, Fatima Ghedjati, Abdelaziz Hamzaoui
2011 International Journal of Applied Metaheuristic Computing  
An integrated ant colony optimization algorithm (IACS-HFS) is proposed for a multistage hybrid flow-shop scheduling problem. The objective of scheduling is the minimization of the makespan.  ...  The performance of the algorithm is evaluated by numerical experiments on benchmark problems taken from the literature.  ...  We quote hereafter, some recent studies carried out on the HFS problem minimizing the makespan.  ... 
doi:10.4018/jamc.2011010103 fatcat:srzwsncnv5anhltqxhnl4tjyta

A supervised method for scheduling multi-objective job shop systems in the presence of market uncertainties

Aidin Delgoshaei, Aisa Khoshniat Aram, Alireza Rezanoori, Sepehr Esmaeili Hanjani, Golnaz Hooshmand Pakdel, Fatemeh Shirmohamdi
2020 Reserche operationelle  
The purpose of this research is to develop a new scheduling method for job-shop systems in the presence of uncertain demands while optimizing completion time, operational costs and machine load average  ...  In this research a new multi-objective nonlinear mixed integer programming method is developed for job-shop scheduling in the presence of product demand uncertainty.  ...  The authors would like to sincerely appreciate the editor and also anonymous reviewers for their constructive comments during publication process.  ... 
doi:10.1051/ro/2020082 fatcat:o5e2m57tjfbybkezcmno3hi2ye

Population-based Tabu search with evolutionary strategies for permutation flow shop scheduling problems under effects of position-dependent learning and linear deterioration

Oğuzhan Ahmet Arık
2020 Soft Computing - A Fusion of Foundations, Methodologies and Applications  
This paper investigates permutation flow shop scheduling (PFSS) problems under the effects of position-dependent learning and linear deterioration.  ...  The time requirement for solving large-scale problems type of PFSS problem is exceedingly high.  ...  Liaw (2000) integrated TS into GA for the open shop scheduling problem where the objective is to minimize the makespan.  ... 
doi:10.1007/s00500-020-05234-7 fatcat:bhg6msr5jberddl6iadfqitmci
« Previous Showing results 1 — 15 out of 968 results