Filters








298 Hits in 5.0 sec

A Kind of Reinforcement Learning to Improve Genetic Algorithm for Multiagent Task Scheduling

Zhipeng Li, Xiumei Wei, Xuesong Jiang, Yewen Pang, Daniel Zaldivar
2021 Mathematical Problems in Engineering  
We built a multiagent distributed hierarchical intelligent control model for manufacturing systems integrating multiple production units based on multiagent system technology.  ...  For the task assignment problem with this model, we combine reinforcement learning to improve the genetic algorithm for multiagent task scheduling and use the standard task scheduling dataset in OR-Library  ...  Acknowledgments is study was supported in part by the National Key R&D Program of China (no. 2019YFB1707004).  ... 
doi:10.1155/2021/1796296 fatcat:6p2qwbursjgb7htrhr33y3dsi4

Hybrid Metaheuristics within a Holonic Multiagent Model for the Flexible Job Shop Problem

Houssem Eddine Nouri, Olfa Belkahla Driss, Khaled Ghédira
2015 Procedia Computer Science  
The Flexible Job Shop scheduling Problem (FJSP) is an extension of the classical Job Shop scheduling Problem (JSP) that allows to process operations on one machine out of a set of alternative machines.  ...  Firstly, a scheduler agent applies a Neighborhood-based Genetic Algorithm (NGA) for a global exploration of the search space.  ...  In this paper, we propose a hybrid two metaheuristics based within a holonic multiagent model for the flexible job shop scheduling problem.  ... 
doi:10.1016/j.procs.2015.08.107 fatcat:6ti2djw75bgebdqppfqz7lhsaa

Distributed manufacturing scheduling using intelligent agents

Weiming Shen
2002 IEEE Intelligent Systems  
For example, a classical job shop scheduling problem with n jobs, m machines, and k operators could have ((n!) m ) k possible solutions.  ...  Unforeseen dynamic situations In a job shop manufacturing environment, things rarely go as expected. Scheduled jobs get canceled and new jobs are inserted.  ...  Unforeseen dynamic situations In a job shop manufacturing environment, things rarely go as expected. Scheduled jobs get canceled and new jobs are inserted.  ... 
doi:10.1109/5254.988492 fatcat:df4gvk6tmfcnpocj6nzgqhtnsm

Agent-based distributed manufacturing process planning and scheduling: a state-of-the-art survey

Weiming Shen, Lihui Wang, Qi Hao
2006 IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)  
Therefore, there is a need for the integration of manufacturing process-planning and scheduling systems for generating more realistic and effective plans.  ...  Index Terms-Agents, distributed manufacturing systems, manufacturing scheduling, multiagent systems, process planning.  ...  This system can be considered to be a blackboard system. f) Kouiss et al. [49] proposed a multiagent architecture for dynamic job shop scheduling.  ... 
doi:10.1109/tsmcc.2006.874022 fatcat:dgqbnflcqbcftdeuhbpzyf2uoq

Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model

Houssem Eddine Nouri, Olfa Belkahla Driss, Khaled Ghédira
2017 Journal of Industrial Engineering International  
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines.  ...  First, a neighborhood-based genetic algorithm (NGA) is applied by a scheduler agent for a global exploration of the search space.  ...  In this paper, we present how to solve the flexible job shop scheduling problem by a hybridization of two metaheuristics within a holonic multiagent model.  ... 
doi:10.1007/s40092-017-0204-z fatcat:jfn7xva73rdglabe2cnj4kfzyy

A Research Review on Job Shop Scheduling Problem

Yu Yingchen
2021 E3S Web of Conferences  
This paper summarizes the research development and current situation of job shop scheduling problem, classifies the existing research methods, and discusses the future research direction of job shop scheduling  ...  Reasonable and efficient production scheduling determines whether the enterprise can continue to survive. Therefore, the study of job shop scheduling problem has practical significance.  ...  Job shop scheduling problem (JSP) is the core part of production management in job shop system. The efficient completion of production tasks requires reasonable job shop scheduling.  ... 
doi:10.1051/e3sconf/202125302024 doaj:53f2f7555a5f4acd9fb0f5f141c9387e fatcat:qtapnraxvjglpfvpp3p2dwhj5i

MASDScheGATS - Scheduling System for Dynamic Manufacturing Environmemts [chapter]

Ana Madureira, Joaquim Santos, Ivo Pereir
2009 Multiagent Systems  
Scheduling problem in dynamic environments have been investigated by a number of authors, see for example (Aytug et al., 334 In this chapter we will model a Manufacturing System by means of Multi-Agent  ...  This chapter addresses the resolution of scheduling in manufacturing systems subject to perturbations.  ...  Acknowledgments The authors would like to acknowledge FCT, FEDER, POCTI, POSI, POCI 2010 for their support to R&D Projects and the GECAD Unit. References  ... 
doi:10.5772/6609 fatcat:4ooqquw4cbeefkc2oqg5sow3uu

5-17,Tesma305,IJEAST.pdf

Osama Mohammed Elmardi Suleiman Khayal
2018 Figshare  
The scheduling problems are classified based onthe nature of the shop configuration into five classes, i.e.,single machine, parallel machines, flow shop, job shop, andopen shop.  ...  A variety of approaches have been developedto solve the problem of dynamic scheduling.  ...  A multiagent based approach is developed in another work to solve the part scheduling problem in multiple job shop cells with inter cell moves and flexible routes.  ... 
doi:10.6084/m9.figshare.7379393 fatcat:fcdzn7qcpva2lpvzd6kkhxftfu

A survey of dynamic scheduling in manufacturing systems

Djamila Ouelhadj, Sanja Petrovic
2008 Journal of Scheduling  
The problem of scheduling is concerned with searching for optimal (or near-optimal) schedules subject to a number of constraints.  ...  This paper outlines the limitations of static approaches to scheduling in the presence of real-time information and presents a number of issues that have come up in recent years on dynamic scheduling.  ...  multiagent systems.  ... 
doi:10.1007/s10951-008-0090-8 fatcat:ey7we6uyq5azdi2lcruqlxiqje

A Trajectory Based Methods for Parallel Scheduling of Machines and AGV'S in an FMS Environment

P. Sreenivas, Shaik khajapeer saheb, M. Yohan
2017 IOSR Journal of Mechanical and Civil Engineering  
In literature it is assumed that, for machine scheduling models, either there is infinite number of handling or carrier systems for the job to reach desired location or jobs are distributed on the spot  ...  Now a days latest manufacturing sectors facing difficulty with two different categories of processing of parts like semi-finished jobs and finished jobs.  ...  (5) proposed a multiagent based scheduling approach for AGVs and machines within a manufacturing system where the AGV breakdowns are considered.  ... 
doi:10.9790/1684-1403021722 fatcat:fza37skxrzcollnkqzvjtr6uie

Implementation of an online scheduling support system in a high mix manufacturing firm

LSR Krishna, V Mahesh, S Dulluri, CSP Rao
2011 International Journal of Engineering, Science and Technology  
Generating the best job shop schedule with the makespan criterion for a multi-product manufacturing industry in a reasonable time remains a challenging task, due to its NP hard nature.  ...  In this context, this paper discusses the implementation of an online scheduling support system for a high mix manufacturing firm.  ...  Ye Li and Yan Chen (2010) proposed a new genetic algorithm for solving the agile job shop scheduling problem.  ... 
doi:10.4314/ijest.v2i11.64557 fatcat:h56xbh2bava7docszjz4tpz2fi

A Variable Interval Rescheduling Strategy for Dynamic Flexible Job Shop Scheduling Problem by Improved Genetic Algorithm

Lei Wang, Chaomin Luo, Jingcao Cai
2017 Journal of Advanced Transportation  
In this paper, we propose a dynamic rescheduling method based on variable interval rescheduling strategy (VIRS) to deal with the dynamic flexible job shop scheduling problem considering machine failure  ...  In real-world manufacturing systems, production scheduling systems are often implemented under random or dynamic events like machine failure, unexpected processing times, stochastic arrival of the urgent  ...  Acknowledgments This paper is supported by Anhui Provincial Natural Science Foundation (Grant no. 1708085ME129), the National Natural Science Foundation of China (Grant no. 51305001), and Key Support Projects for  ... 
doi:10.1155/2017/1527858 fatcat:5bkosiyueveuzlntbwirvl6ume

A Dynamic Rescheduling Model with Multi-Agent System and Its Solution Method

Fuqing Zhao, Jizhe Wang, Junbiao Wang, Jonrinaldi Jonrinaldi
2012 Strojniski vestnik  
A dynamic rescheduling model, which is based on Multi-Agent System (MAS), was proposed.  ...  Furthermore, the simulation results in dynamic scheduling accompanying with its perturbation show that the proposed model and the algorithm are effective to the dynamic scheduling problem in manufacturing  ...  Goncalves [12] proposed a hybrid genetic algorithm for the job shop scheduling problem with reactive scheduling method. Wong et al.  ... 
doi:10.5545/sv-jme.2011.029 fatcat:lskcgtlokvaybprc4hgfickmwa

A Survey on Parallel Genetic Algorithms for Shop Scheduling Problems

Jia Luo, Didier El Baz
2018 2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)  
There have been extensive works dealing with genetic algorithms (GAs) for seeking optimal solutions of shop scheduling problems. Due to the NP hardness, the time cost is always heavy.  ...  With the development of high performance computing (HPC) in last decades, the interest has been focused on parallel GAs for shop scheduling problems.  ...  ACKNOWLEDGMENT This work was supported by a scholarship from the China Scholarship Council (CSC).  ... 
doi:10.1109/ipdpsw.2018.00103 dblp:conf/ipps/LuoB18 fatcat:kabw5jzsjrf7lfv4kvknc7z4q4

PRODUCTION ENGINEERING

2009 Journal of the American Society of Naval Engineers  
This paper model the problem of a flow shop scheduling with the objective of minimizing the makes pan. The objective is to minimize the make span of batch-processing machines in a flow shop.  ...  The processing time of a batch is the longest processing time among all the jobs in that batch. The problem under study is NP-hard for makespan objective.  ...  They propose a multiagent approach integrated with a filtered-beam-search (FBS)-based heuristic algorithm to study the dynamic scheduling problem in a FMS shop floor consisting of multiple manufacturing  ... 
doi:10.1111/j.1559-3584.1941.tb01541.x fatcat:hbqs6xeppbgtznarcju5vxjzei
« Previous Showing results 1 — 15 out of 298 results