Filters








951 Hits in 12.1 sec

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

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

Su Nguyen, Yi Mei, Mengjie Zhang
2017 Complex & Intelligent Systems  
Many studies have shown that heuristics evolved by genetic programming can outperform many existing heuristics manually designed in the literature.  ...  In this paper, a unified framework for automated design of production scheduling heuristics with genetic programming is developed.  ...  [75] proposed to combine the advantage of GP and NSGA-III to evolve a set of Pareto-optimal dispatching rules for many-objective job shop scheduling.  ... 
doi:10.1007/s40747-017-0036-x fatcat:jyqymikcqvgndojckycnfzjs2y

Learning iterative dispatching rules for job shop scheduling with genetic programming

Su Nguyen, Mengjie Zhang, Mark Johnston, Kay Chen Tan
2013 The International Journal of Advanced Manufacturing Technology  
Evolving reusable v vi LIST OF PUBLICATIONS operation-based due-date assignment models for job shop scheduling with genetic programming".  ...  A coevolution genetic programming method to evolve scheduling policies for dynamic multiobjective job shop scheduling problems".  ...  Tay and Ho [181] have suggested a GP method to evolve dispatching rules for multi-objective flexible job shop scheduling problems.  ... 
doi:10.1007/s00170-013-4756-9 fatcat:rgnsvur5nrh3lhpzc2j5s7agta

Hyper-Heuristic Coevolution of Machine Assignment and Job Sequencing Rules for Multi-Objective Dynamic Flexible Job Shop Scheduling

Yong Zhou, Jian-Jun Yang, Lian-Yu Zheng
2019 IEEE Access  
INDEX TERMS Scheduling, flexible job shop, hyper-heuristic, multi-objective, genetic programming.  ...  Three types of hyper-heuristic methods were proposed in this paper for coevolution of the machine assignment rules and job sequencing rules to solve the multi-objective dynamic flexible job shop scheduling  ...  There are many studies that using GP based hyper-heuristic to evolve dispatching rules for many production environments covering single machine scheduling, parallel machine scheduling, job shop scheduling  ... 
doi:10.1109/access.2018.2883802 fatcat:hnledybojvbzpdlhndgmn6paom

An efficient dynamic dispatching rule for scheduling in a job shop

T.S. Raghu, Chandrasekharan Rajendran
1993 International Journal of Production Economics  
Feature selection techniques can reduce the terminal set size without discarding important information and they have shown to be effective for improving rule generation for dynamic job shop scheduling.  ...  Since hand-crafted rules can be time and effort-consuming, many papers employ genetic programming to generate optimum rule trees from a set of terminals and operators.  ...  CONCLUSION AND FUTURE WORK This paper proposed an extension to Niching-GP Feature selection (NiSuFS) to be compatible with multitree genetic programming for Dynamic Flexible Job Shop Scheduling.  ... 
doi:10.1016/0925-5273(93)90044-l fatcat:btfd5qxsofccxekzmtd4pmuohi

Designing Dispatching Rules to Minimize Total Tardiness [chapter]

Joc Cing Tay, Nhu Binh Ho
2007 Studies in Computational Intelligence  
We approximate optimal solutions to the Flexible Job-Shop Problem by using dispatching rules discovered through Genetic Programming.  ...  In this work, we employ suitable parameter and operator spaces for evolving Composite Dispatching Rules using Genetic Programming, with an aim towards greater scalability and flexibility.  ...  Terminal set In job-shop scheduling, there are many parameters that can effect the quality of results; potentially, all of them can be considered to comprise a dispatching rule.  ... 
doi:10.1007/978-3-540-48584-1_4 fatcat:eztoovvnxnb6zbylcjuv4rid5a

Assigning dispatching rules using a genetic algorithm to solve a hybrid flow shop scheduling problem

Benjamin Rolf, Tobias Reggelin, Abdulrahman Nahhas, Sebastian Lang, Marcel Müller
2020 Procedia Manufacturing  
The paper shows how assigning different predefined dispatching rules for a predefined number of times at any points in time using a genetic algorithm can solve a hybrid flow shop scheduling problem with  ...  Abstract The paper shows how assigning different predefined dispatching rules for a predefined number of times at any points in time using a genetic algorithm can solve a hybrid flow shop scheduling problem  ...  Furthermore, determining the dispatching rules per machine rather than per production stage can be a possibility to yield even better solutions.  ... 
doi:10.1016/j.promfg.2020.02.051 fatcat:5wtwl66swfhmtnoeewgso3xtkm

Multi-agent based hyper-heuristics for multi-objective flexible job shop scheduling: A case study in an aero-engine blade manufacturing plant

Yong Zhou, Jian-Jun Yang, Lian-Yu Zheng
2019 IEEE Access  
INDEX TERMS Scheduling, flexible job shop, multi-agent, hyper-heuristics, genetic programming. NOMENCLATURE NSGAII Nondominated sorting genetic algorithm II.  ...  To this end, three multi-agentbased hyper-heuristics (MAHH) integrated with the prior knowledge of the shop floor are proposed to evolve scheduling policies (SPs) for the online scheduling problem.  ...  ACKNOWLEDGEMENT The authors would like to thank Qing-miao Liao and Peng-cheng Fang for their support and contributions during the development of this work.  ... 
doi:10.1109/access.2019.2897603 fatcat:zpysik5q6ranrbele6r7zz2pqa

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

Evolving control rules for a dual-constrained job scheduling scenario

Jurgen Branke, Matthew J. Groves, Torsten Hildebrandt
2016 2016 Winter Simulation Conference (WSC)  
In this paper, we extend this idea to dual-constrained flow shop scheduling, with machines and operators for loading and unloading to be scheduled simultaneously.  ...  Dispatching rules are often used for scheduling in semiconductor manufacturing due to the complexity and stochasticity of the problem.  ...  non-evolved scheduling policies that combine dispatching rules with due-date assignment rules.  ... 
doi:10.1109/wsc.2016.7822295 dblp:conf/wsc/BrankeGH16 fatcat:w2nvrcgnzjftrbmic6uovpjsva

A comparative representation approach to modern heuristic search methods in a job shop

P.D.D. Dominic, Ahmad Kamil Bin Mahmood, P. Parthiban, S.C. Lenny Koh
2008 International Journal of Logistics Economics and Globalisation  
This Research paper addresses the problem of static job shop scheduling on the job-based representation and the rule based representations.  ...  Various rules like the SPT, LPT, MWKR, and LWKR are used for the objective function to attain the results.  ...  Genetic algorithms seem to be better than the simulated annealing algorithm for the objective makespan time. of hybrid genetic algorithm for job shop scheduling problem proposed.  ... 
doi:10.1504/ijleg.2008.023170 fatcat:azj54dshizhdbpgv6yh7wxy7ye

A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling

Emma Hart, Kevin Sim
2016 Evolutionary Computation  
Keywords Job-shop-scheduling, dispatching rule, heuristic ensemble, hyper-heuristic, genetic programming (2015) who summarize the state-of-the-art, noting that the most common approach has been to use  ...  We describe a new hyper-heuristic method NELLI-GP for solving job-shop scheduling problems (JSSP) that evolves an ensemble of heuristics.  ...  Dispatching Rules Many simple dispatching rules have been developed to quickly prioritise operations in order to select an appropriate operation for scheduling in an iterative process (see Panwalkar and  ... 
doi:10.1162/evco_a_00183 pmid:27120113 fatcat:sox43qmaezctjinsugmzhhf2k4

Large-scale simulation-based optimization of semiconductor dispatching rules

Torsten Hildebrandt, Debkalpa Goswami, Michael Freitag
2014 Proceedings of the Winter Simulation Conference 2014  
Using the objective of minimizing the mean cycle time of lots, we show that rules created automatically using Genetic Programming (GP) can clearly outperform standard rules.  ...  Developing dispatching rules for complex production systems such as semiconductor manufacturing is an involved task usually performed manually.  ...  rules for a dynamic job shop scheduling problem.  ... 
doi:10.1109/wsc.2014.7020102 dblp:conf/wsc/HildebrandtGF14 fatcat:ghxo33fjdfdvljpowbbki2tam4

Jackson Network [chapter]

2013 Encyclopedia of Operations Research and Management Science  
SVMs has been applied for the dynamic dispatching rule selection classifier (Shiuea 2009 ).  ...  Many similar investigations have been carried out to determine the dispatching rule which optimizes a wide range of job-related (such as due date and tardiness) and shop-related (such as throughput and  ... 
doi:10.1007/978-1-4419-1153-7_200352 fatcat:hzfoidzgwngwtlvnqa4kkejl4i

Genetic Programming Based Hyper-heuristics for Dynamic Job Shop Scheduling: Cooperative Coevolutionary Approaches [chapter]

John Park, Yi Mei, Su Nguyen, Gang Chen, Mark Johnston, Mengjie Zhang
2016 Lecture Notes in Computer Science  
Second, we extend an existing approach for static JSS problem, called Ensemble Genetic Programming for Job Shop Scheduling (EGP-JSS), by adding "less-myopic" terminals that take job and machine attributes  ...  Therefore, we compare two coevolutionary GP approaches to evolve ensembles of dispatching rules for dynamic JSS problem.  ...  High-level features extracted from methods such as Speeded Up Robust Features (SURF) and Histogram of Oriented Gradients (HoG) are commonly used for object detection with machine learning techniques.  ... 
doi:10.1007/978-3-319-30668-1_8 fatcat:lbrbspjnzjc67isn3egi56uycu
« Previous Showing results 1 — 15 out of 951 results