1,470 Hits in 7.5 sec

Integrating Genetic Algorithm, Tabu Search Approach for Job Shop Scheduling [article]

R. Thamilselvan, Dr. P. Balasubramanie
2009 arXiv   pre-print
This paper presents a new algorithm based on integrating Genetic Algorithms and Tabu Search methods to solve the Job Shop Scheduling problem.  ...  This paper applies Genetic Algorithms and Tabu Search for Job Shop Scheduling problem and compares the results obtained by each.  ...  Tabu Search (TS) Tabu search is a metaheuristic algorithm that can be used for solving combinatorial optimization problems, such as the Job Shop Scheduling (JSS).  ... 
arXiv:0906.5070v1 fatcat:34vavmmn3bcbrpalnayjwr6jou

Multi-Agent Model based on Tabu Search for the Permutation Flow Shop Scheduling Problem

2014 Advances in Distributed Computing and Artificial Intelligence Journal  
For these reasons we opted for a Multi-agent architecture based on cooperative behaviour allied with the Tabu Search metaheuristic.  ...  KEYWORD ABSTRACT Scheduling Permutation flow shop Tabu Search Multi-agent system The objective of this work is to present a distributed approach for the problem of finding a minimum makespan in the permutation  ...  on Tabu Search for the Permutation Flow Shop Scheduling Problem  ... 
doi:10.14201/adcaij2014382737 fatcat:faut5ghbqjc7vbcuq43r2la6j4

Model for Integrating Production Scheduling and Maintenance Planning of Flow Shop Production system

Adel AL-Shayea, Emad Fararah, Emad Abouel Nasr, Haitham A. Mahmoud
2020 IEEE Access  
The authors would like to thank the Deanship of Scientific Research and RSSU at King Saud University for their technical support.  ...  ACKNOWLEDGMENT The authors extend their appreciation to the Deanship of Scientific Research at King Saud University for funding this work through research group No (RG-1439-009).  ...  Then, tabu search has TS algorithm based on LPT been utilized to influence a near optimal solution.  ... 
doi:10.1109/access.2020.3038719 fatcat:ymiwqjzlunajji24x7ltv7le6e

A Collaborative Search Strategy to Solve Combinatorial Optimization and Scheduling Problems [chapter]

Nader Azizi, Saeed Zolfaghari, Ming Liang
2010 Modeling Simulation and Optimization - Tolerance and Optimal Control  
Based on the proposed framework a search algorithm tailored for the flow shop scheduling is presented.  ...  Ruiz et al., (2006) also proposed a hybrid GA for the flow shop scheduling problem. In their method, the entire initial population is generated using a modified NEH (Newaz et al., 1983) algorithm.  ... 
doi:10.5772/9030 fatcat:5iupddwzcbbv7aazaoemywe4ou

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.  ...  Job-shop Scheduling Problem The job-shop scheduling problem (JSSP) is a common scheduling problem, in which multiple jobs (1 ≤ ≤  ...  Ranjbar and Razavi [4] developed a hybrid metaheuristic approach based on the scatter search algorithm to concurrently make the layout and scheduling decisions in a job-shop environment.  ... 
doi:10.18178/jiii.7.1.12-17 fatcat:d3crakphjnej5joqux6jtvcory

Page 712 of Mathematical Reviews Vol. , Issue 97A [page]

1997 Mathematical Reviews  
: appli- cation to the job-shop scheduling problem (219-236); Takeshi Yamada and Ryohei Nakano, Job-shop scheduling by simulated annealing combined with deterministic local search (237-248); Mark A.  ...  Sacramento Quin- tanilla, A modified tabu thresholding approach for the gener- alised restricted vertex colouring problem (537-553); David L.  ... 

Product Service Scheduling Problem with Service Matching Based on Tabu Search Method

Liu Cheng Hao, Wang Yan Hong, Qiu Jia Wei, Dong Wei Zhao, Shan Rui
2020 Journal of Advanced Transportation  
This problem is a complex scheduling problem that integrates multiple traveling salesman problem (MTSP) and multiple service types. To solve the problem, a tabu search method was presented.  ...  The historical search solutions are taken as tabu object, and limiting the quantity of search neighborhood solution is taken as the aspiration level.  ...  [24] considered the tabu search technique to solve job shop scheduling problems. Girard et al. [25] presented a fast tabu search method for the design of access tree networks.  ... 
doi:10.1155/2020/5748680 fatcat:5kasy2f2rfbkjpdddd2papgory

Metaheuristics for Group Shop Scheduling [chapter]

Michael Sampels, Christian Blum, Monaldo Mastrolilli, Olivia Rossi-Doria
2002 Lecture Notes in Computer Science  
The Group Shop Scheduling Problem (GSP) is a generalization of the classical Job Shop and Open Shop Scheduling Problems. In the GSP there are m machines and n jobs.  ...  The main goal of this paper is to provide a fair comparison of five metaheuristic approaches (i.e., Ant Colony Optimization, Evolutionary Algorithm, Iterated Local Search, Simulated Annealing, and Tabu  ...  We would like to thank Anthony Liekens and Huub ten Eikelder for the implementation of the problem representation and the local search.  ... 
doi:10.1007/3-540-45712-7_61 fatcat:u5fpoma73naojf5ks2mbjbfg6a

Resource planning for just-in-time make-to-order environments: A scalable methodology using tabu search

Scott A. Moses, Wassama Sangplung, Wenjun Xu
2017 Cogent Engineering  
This paper develops a two-phase tabu search-based methodology for detailed resource planning in make-to-order production systems with multiple resources, unique routings, and varying job due dates.  ...  Computational experiments reveal that the tabu search-based methodology is more effective and reliable for resource planning than an exact approach using binary integer linear programming, which struggles  ...  Zhu, Ng, and Ong (2010) proposed a modified tabu search algorithm in a job shop problem with a JIT environment.  ... 
doi:10.1080/23311916.2017.1341289 fatcat:aosrnouelzdyvojx4sbmvogkpq

A New Approach to Solve Multi-Objective Scheduling and Rescheduling Tasks

A.P. Engelbrecht, Gyula Kulcsár
2007 International Journal of Computational Intelligence Research  
The proposed method is based on the well-known tabu search meta-heuristic. Moreover we use an advanced structure of the tabu list, new relational and neighbourhood operators for multi-objective aim.  ...  In this paper a new approach is presented to solve multi-objective production scheduling and rescheduling problems.  ...  The authors express their thanks for the support.  ... 
doi:10.5019/j.ijcir.2007.115 fatcat:fngtc2dvrzhhvjdnoqj4yhqtxi

Concurrent Openshop Problem to Minimize the Weighted Number of Late Jobs [chapter]

H.L. Huang, B.M.T. Li
2007 Multiprocessor Scheduling, Theory and Applications  
One is for small-scale problems solved by two different branching schemes, heuristic and tabu search method. The other is for largescale problems solved by heuristic and tabu search method.  ...  For all test instances, the tabu search algorithm can find optiml solutions.Table 1. B&B vs.  ...  This volume contains four major parts that cover the following directions: the state of the art in theory and algorithms for classical and non-standard scheduling problems; new exact optimization algorithms  ... 
doi:10.5772/5223 fatcat:5pyybcqw6ngf7hucmrwnf5d5a4

An effective hybrid imperialist competitive algorithm and tabu search for an extended flexible job shop scheduling problem

Willian Tessaro Lunardi, Holger Voos, Luiz Henrique Cherri
2019 Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing - SAC '19  
In order to produce reasonable outcomes in acceptable time, a hybrid imperialist competitive algorithm and tabu search is proposed to solve the problem.  ...  An extended version of the flexible job shop problem is tackled in this work.  ...  A modified cost-based version of the BFS algorithm is used to define the topological order of each job.  ... 
doi:10.1145/3297280.3297302 dblp:conf/sac/LunardiVC19 fatcat:c2qkcfeysbg37im2girizualgi

Jackson Network [chapter]

2013 Encyclopedia of Operations Research and Management Science  
Glover (1996) showed some specialized implementations of tabu search methods for job shop and flow shop scheduling problems, including a number of important cases where tabu search methods are superior  ...  As the job shop operates over time, it is important to be able to modify the knowledge contained in these rule bases.  ... 
doi:10.1007/978-1-4419-1153-7_200352 fatcat:hzfoidzgwngwtlvnqa4kkejl4i


Wojciech Bożejko, Zdzisław Hejducki, Mariusz Uchroński, Mieczysław Wodecki
2014 Journal of Civil Engineering and Management  
We introduce the new: mathematical model, specific properties as an acceleration tools, as well as two new optimization algorithms for the problem considered: construction and tabu search.  ...  The paper concerns the problem of roadworks scheduling executed in the flow-shop system.  ...  To determine the starting solution, for the tabu search algorithm, we have used a modified version of the NEH algorithm (Nawaz et al. 1983 ).  ... 
doi:10.3846/13923730.2014.906496 fatcat:kvjztr764nbydhdxajijoa43ba

A survey of scheduling problems with setup times or costs

Ali Allahverdi, C.T. Ng, T.C.E. Cheng, Mikhail Y. Kovalyov
2008 European Journal of Operational Research  
algorithm.  ...  Allahverdi and Al-Anzi (2002) showed that the MDO scheduling problem for WWW applications can be modeled as a two-machine flow shop scheduling problem with separate setup times. • Kim et al. (2002) considered  ...  Logendran et al. (2005b) developed three tabu search-based algorithms for the same problem.  ... 
doi:10.1016/j.ejor.2006.06.060 fatcat:gaq5slhjsjfybjpx54qcveslme
« Previous Showing results 1 — 15 out of 1,470 results