Filters








10,280 Hits in 6.8 sec

An Improve Object-oriented Approach for Multi-objective Flexible Job-shop Scheduling Problem (FJSP)

BamaiyiSule, Ibrahim Lawal
2019 Zenodo  
Flexible job-shop scheduling problem (FJSP) is one of the instances in this domain. It is a problem which acquires the job-shop scheduling problems (JSP).  ...  In scheduling sub-problem, the sequence of assigned operations is obtained while optimizing the objective function(s).  ...  Research Framework Multi Objective Flexible Job Shop Scheduling Analysis In the review of literatures so many approaches were applied to solve flexible job shop scheduling problem.  ... 
doi:10.5281/zenodo.3582349 fatcat:rjmp2rod7bfwpif3lgrguynqjq

REVIEW ON JOB-SHOP AND FLOW-SHOP SCHEDULING USING

Sultana Parveen, Hafiz Ullah
2011 Journal of Mechanical Engineering  
Scheduling is widely studied and complex combinatorial optimization problems. A vast amount of research has been performed in this particular area to effectively schedule jobs for various objectives.  ...  This paper discusses the more recent literature on scheduling using multi criteria decision making (MCDM). This article addresses both job-shop and flow-shop scheduling problem.  ...  Job-shop Scheduling A job-shop does not have the same restriction on workflow as a flow-shop. In a job-shop, jobs can be processed on machines in any order.  ... 
doi:10.3329/jme.v41i2.7508 fatcat:jtdncw2ldjbrxo3tf4w2ve2wny

Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems

Joc Cing Tay, Nhu Binh Ho
2008 Computers & industrial engineering  
We solve the multi-objective flexible job-shop problems by using dispatching rules discovered through genetic programming.  ...  In this paper, we evaluate and employ suitable parameter and operator spaces for evolving composite dispatching rules using genetic programming, with an aim towards greater scalability and flexibility.  ...  In this paper, we investigate the potential use of genetic programming (GP) for evolving effective and robust composite dispatching rules for solving the multi-objective FJSP.  ... 
doi:10.1016/j.cie.2007.08.008 fatcat:q7je2jc5c5gixlxaji6k435ksi

Literature Review of Open Shop Scheduling Problems

Ellur Anand, Ramasamy Panneerselvam
2015 Intelligent Information Management  
sum of weighted tardiness of all jobs, minimization of weighted sum of tardy jobs, and miscellaneous measures of the open shop scheduling problem.  ...  This paper discusses review of literature of open shop scheduling problems.  ...  Acknowledgements The authors thank the anonymous referees for their constructive suggestions, which have improved the paper. References  ... 
doi:10.4236/iim.2015.71004 fatcat:shukynonjrfaleqiousjru3ari

A hybrid genetic tabu search algorithm for solving job shop scheduling problems: a case study

S. Meeran, M. S. Morshed
2011 Journal of Intelligent Manufacturing  
In recent decades many attempts have been made at the solution of Job Shop Scheduling Problem using a varied range of tools and techniques such as Branch and Bound at one end of the spectrum and Heuristics  ...  In this paper we bring out the system's practical usage aspect and demonstrate that the system is equally capable of solving real life Job Shop problems.  ...  The solution to the job shop scheduling problem (JSSP) has a strong practical implication as many manufacturing organisations may fit the definition of a job shop.  ... 
doi:10.1007/s10845-011-0520-x fatcat:nms33osmababnedvrrsxd5fcz4

Hybrid Intelligent Algorithm for Flexible Job-Shop Scheduling Problem under Uncertainty [chapter]

Guojun Zhang, Haiping Zhu, Chaoyong Zhang
2011 Advances in Reinforcement Learning  
In this paper, describing the uncertain information in the real job-shops with several stochastic variables, a stochastic multi-objectives and multi-priorities programming model for Flexible job-shop scheduling  ...  Job-Shop Scheduling problem aiming at objectives of shorter production time, lower cost and equilibrium of schedule.  ...  Hybrid Intelligent Algorithm for Flexible Job-Shop Scheduling Problem under Uncertainty, Advances in Reinforcement Learning, Prof.  ... 
doi:10.5772/13195 fatcat:6rfzylvckvghzdhupi4keytpz4

Genetic programming for production scheduling: a survey with a unified framework

Su Nguyen, Yi Mei, Mengjie Zhang
2017 Complex & Intelligent Systems  
Genetic programming has been a powerful technique for automated design of production scheduling heuristics.  ...  In this paper, a unified framework for automated design of production scheduling heuristics with genetic programming is developed.  ...  [90] developed a multi-objective genetic programming-based hyper-heuristic (MO-GPHH) for dynamic job shop scheduling.  ... 
doi:10.1007/s40747-017-0036-x fatcat:jyqymikcqvgndojckycnfzjs2y

Flexible job-shop scheduling based on genetic algorithm and simulation validation

Erming Zhou, Jin Zhu, Ling Deng, L. You, J. Cai, L. Zhao, A. Xavior
2017 MATEC Web of Conferences  
This paper selects flexible job-shop scheduling problem as the research object, and Constructs mathematical model aimed at minimizing the maximum makespan.  ...  Taking the transmission reverse gear production line of a transmission corporation as an example, genetic algorithm is applied for flexible jobshop scheduling problem to get the specific optimal scheduling  ...  Acknowledgement The authors wish to acknowledge the support and motivation provided by Jiangxi Science Support Program (20151BBE 50053).  ... 
doi:10.1051/matecconf/201710002047 fatcat:5yniszbtrrdb3djviw3mprv7ry

An enhanced genetic algorithm with simulated annealing for job-shop scheduling

A Tamilarasi, T Anantha kumar
2010 International Journal of Engineering, Science and Technology  
In this paper we proposed a new method for solving job-shop scheduling problem using hybrid Genetic Algorithm (GA) with Simulated Annealing (SA).  ...  for n jobs and m machines.  ...  Acknowledgment This project work is supported by University Grants Commission; New Delhi under the Major Research Project Grant (F.No. 33-65/2007(SR)) entitled "Job Shop Scheduling using Heuristic Methods  ... 
doi:10.4314/ijest.v2i1.59105 fatcat:luhkuncff5gbfcg2skc6btfzhu

Two meta-heuristic algorithms for flexible flow shop scheduling problem with robotic transportation and release time

Seyedeh Sarah Zabihzadeh, Javad Rezaeian
2016 Applied Soft Computing  
The main contribution of this study is to present the mixed integer linear programming model for the problem which considers release times for parts in scheduling area, loading and unloading times of parts  ...  In this research, flexible flow shop scheduling with unrelated parallel machines at each stage are considered.  ...  All rights reserved. considered no-wait job shop scheduling problems and the objective is minimizing the total completion time.  ... 
doi:10.1016/j.asoc.2015.11.008 fatcat:oyevf33slzfohabf4s2djg4jhm

An Efficient Solution to the Mixed Shop Scheduling Problem Using a Modified Genetic Algorithm

V. Nguyen, H.P. Bao
2016 Procedia Computer Science  
GA based solutions have been proposed for flexible Job shops. This paper proposes a GA algorithm for the mixed job shop scheduling problem.  ...  The mixed job shop scheduling problem is one in which some jobs have fixed machine orders and other jobs may be processed in arbitrary orders.  ...  Genetic algorithm has been applied to "pure" shop scheduling problems (flow shop, job shop and open shop) and combinatorial problems such as flexible job-shop and stage shop scheduling.  ... 
doi:10.1016/j.procs.2016.09.324 fatcat:sopan3hiavdnrgwntwvstzlvua

AN EFFECTIVE GENETIC ALGORITHM FOR FLOW SHOP SCHEDULING PROBLEMS TO MINIMIZE MAKESPAN

Jeen Robert R.B, Rajkumar R
2017 Mechanics  
Therefore we thought of minimizing makespan as objective for my present work using meta-heuristic approach by improvising the Genetic algorithmic program.  ...  During this a general purpose schedule optimizer for manufacturing flow shops planning using genetic algorithms.  ...  Keywords: Flow shop scheduling, Makespan, Genetic Algorithm, Matlab.  ... 
doi:10.5755/j01.mech.23.4.15053 fatcat:eh3bylnegnehjjkc3xcwfyfdhm

A Promising Initial Population Based Genetic Algorithm for Job Shop Scheduling Problem

Vedavyasrao S. Jorapur, Vinod S. Puranik, Anand S. Deshpande, Mahesh Sharma
2016 Journal of Software Engineering and Applications  
Job shop scheduling problem is typically a NP-Hard problem.  ...  In the recent past efforts put by researchers were to provide the most generic genetic algorithm to solve efficiently the job shop scheduling problems.  ...  Extensive use of genetic algorithms to solve job shop scheduling problems can be seen through literature survey [10] .  ... 
doi:10.4236/jsea.2016.95017 fatcat:d3rv2jwpuvbmdo5ega2lrwffby

A Genetic Algorithm for Job-Shop Scheduling

Ye Li, Yan Chen
2010 Journal of Software  
A new genetic algorithm for solving the agile job shop scheduling is presented to solve the job shop scheduling problem. Initial population is generated randomly.  ...  The result shows that the genetic algorithm has been successfully applied to the job shop scheduling problems efficiency. [ 4221134233114234 ] in 4 job×4 machines problem.  ...  GA FOR JOB SHOP SCHEDULING PROBLEM The GA was first introduced by Holland(1975).  ... 
doi:10.4304/jsw.5.3.269-274 fatcat:agrsaswvmbemliadan7gzm267a

Reentrant Flow Shop Scheduling considering Multiresource Qualification Matching

Feng Chu, Ming Liu, Xin Liu, Chengbin Chu, Juan Jiang
2018 Scientific Programming  
In this paper, we consider a reentrant flow shop scheduling problem with multiresource considering qualification matching. The objective of the problem is to minimize the total number of tardy jobs.  ...  With the development of technology and industry, new research issues keep emerging in the field of shop scheduling.  ...  This work was also supported by the Fundamental Research Funds for the Central Universities.  ... 
doi:10.1155/2018/2615096 fatcat:o3bjibdo7beshhlwisb5ajbi5q
« Previous Showing results 1 — 15 out of 10,280 results