Filters








11,820 Hits in 9.0 sec

Combining Neighbourhoods in Fuzzy Job Shop Problems [chapter]

Jorge Puente, Camino R. Vela, Inés González-Rodríguez
2011 Lecture Notes in Computer Science  
In the sequel, we propose a new neighbourhood structure for local search for the fuzzy job shop scheduling problem, which is a variant of the well-known job shop problem, where uncertain durations are  ...  The new neighbourhood structure is based on changing the position of a task in a critical block.  ...  Conclusions We have cosidered a job shop problem with uncertain durations modelled as TFNs.  ... 
doi:10.1007/978-3-642-25274-7_35 fatcat:6ejvlh3rbjczfp2kdcubt3r4qm

Improving Local Search for the Fuzzy Job Shop Using a Lower Bound [chapter]

Jorge Puente, Camino R. Vela, Alejandro Hernández-Arauzo, Inés González-Rodríguez
2010 Lecture Notes in Computer Science  
We consider the fuzzy job shop problem, where uncertain durations are modelled as fuzzy numbers and the objective is to minimise the expected makespan.  ...  A recent local search method from the literature has proved to be very competitive when used in combination with a genetic algorithm, but at the expense of a high computational cost.  ...  Conclusions We have considered a job shop problem with uncertain durations modelled as TFNs and have proposed two changes in a local search method from the literature to improve its efficiency.  ... 
doi:10.1007/978-3-642-14264-2_23 fatcat:um7juzascrdntfea42lyqkrbwi

Particle Swarm Optimisation for Open Shop Problems with Fuzzy Durations [chapter]

Juan José Palacios, Inés González-Rodríguez, Camino R. Vela, Jorge Puente
2011 Lecture Notes in Computer Science  
In this paper we confront a variation of the open shop problem where task durations are allowed to be uncertain and where uncertainty is modelled using fuzzy numbers.  ...  Finally, the performance of the PSO is tested on several benchmark problems, modified so as to have fuzzy durations, compared with a memetic algorithm from the literature.  ...  Acknowledgments This work is supported by the Spanish Ministry of Science and Education under research grant MEC-FEDER TIN2010-20976-C02-02.  ... 
doi:10.1007/978-3-642-21344-1_38 fatcat:n7arigudtbfjjipiodvxslgjby

Hybrid Tabu Search for Fuzzy Job Shop [chapter]

Juan José Palacios, Jorge Puente, Inés González-Rodríguez, Camino R. Vela
2013 Lecture Notes in Computer Science  
We consider the fuzzy job shop scheduling problem, which is a variant of the well-known job shop problem, with uncertainty in task durations that we model using fuzzy numbers.  ...  We propose a tabu search algorithm for minimising the expected makespan based on reversing arcs within critical blocks.  ...  Acknowledgements This research has been supported by the Spanish Government under research grants FEDER TIN2010-20976-C02-02 and MTM2010-16051.  ... 
doi:10.1007/978-3-642-38637-4_39 fatcat:jupbqim7ibdkbocobal4bjpvdm

Heuristic local search for fuzzy open shop scheduling

Ines Gonzalez-Rodriguez, Juan Jose Palacios, Camino R. Vela, Jorge Puente
2010 International Conference on Fuzzy Systems  
We further illustrate its good behaviour with experimental results obtained by incorporating the local search procedure to an existing genetic algorithm from the literature and provide a new benchmark  ...  We propose a neighbourhood structure for local search procedures, based on reversing critical arcs in the associated disjunctive graph.  ...  ACKNOWLEDGMENTS This work is supported by the Spanish Government under grants no. MEC-FEDER Grant TIN2007-67466-C02-01 and and MTM2007-62799.  ... 
doi:10.1109/fuzzy.2010.5584235 dblp:conf/fuzzIEEE/RodriguezPVP10 fatcat:4uq2nf4xgvaevbow7keuvywzfi

A Genetic Algorithm for the Open Shop Problem with Uncertain Durations [chapter]

Juan José Palacios, Jorge Puente, Camino R. Vela, Inés González-Rodríguez
2009 Lecture Notes in Computer Science  
We consider a variation of the open shop problem where task durations are allowed to be uncertain and where uncertainty is modelled using fuzzy numbers.  ...  Finally, the performance of the proposed genetic algorithm is tested on several benchmark problems, modified so as to have fuzzy durations, compared with a greedy heuristic from the literature.  ...  Open Shop Scheduling with Uncertain Durations The open shop scheduling problem, or OSP in short, consists in scheduling a set of n jobs J 1 , . . . , J n to be processed on a set of m physical resources  ... 
doi:10.1007/978-3-642-02264-7_27 fatcat:x43e3dcmzjenvoveb2oble66tm

A Genetic Approach to the Job Shop Scheduling Problem with Interval Uncertainty [chapter]

Hernán Díaz, Inés González-Rodríguez, Juan José Palacios, Irene Díaz, Camino R. Vela
2020 Communications in Computer and Information Science  
In this paper we tackle a variant of the job shop scheduling problem where task durations are uncertain and only an interval of possible values for each task duration is known.  ...  We propose a genetic algorithm to minimise the schedule's makespan that takes into account the problem's uncertainty during the search process.  ...  This is essential to devise successful local search methods, as shown in deterministic job shop. A summary of the main results together with a thorough literature review can be found in [3] .  ... 
doi:10.1007/978-3-030-50143-3_52 fatcat:wa7pijw3gfg6lme5b5gwg4pdde

Coevolutionary makespan optimisation through different ranking methods for the fuzzy flexible job shop

Juan José Palacios, Inés González-Rodríguez, Camino R. Vela, Jorge Puente
2015 Fuzzy sets and systems (Print)  
In this paper we tackle a variant of the flexible job shop scheduling problem with uncertain task durations modelled as fuzzy numbers.  ...  Additionally, we incorporate a specific local search method for each population.  ...  Acknowledgements This research has been supported by the Spanish and Asturias Governments under grants FEDER TIN2010-20976-C02-02, MTM2010-16051 and FICYT grants FC-13-COF13-035 and BP13106.  ... 
doi:10.1016/j.fss.2014.12.003 fatcat:ezwzkkwim5f3zmajoebqs5rhnu

Optimization of Multi-objective Job-shop Scheduling under Uncertain Environment

Cheng Wang, Lei Zeng
2019 Journal Europeen des Systemes Automatises  
In this paper, the multi-objective job-shop scheduling problem (JSP) is optimized based on the tradeoff between time, cost and robustness.  ...  Job-shop production often faces many uncertainties arising from the interaction between various resources.  ...  [9] designed a GA to create the job-shop scheduling model and algorithm for complex jobshop scheduling.  ... 
doi:10.18280/jesa.520210 fatcat:fqgnvv4qzndclhxpzqdhwqoyqm

Robust swarm optimisation for fuzzy open shop scheduling

Juan José Palacios, Inés González-Rodríguez, Camino R. Vela, Jorge Puente
2014 Natural Computing  
In this paper we consider a variant of the open shop problem where task durations are allowed to be uncertain and where uncertainty is modelled using fuzzy numbers.  ...  Solutions to this problem are fuzzy schedules, which we argue should be seen as predictive schedules, thus establishing links with the concept of robustness and a measure thereof.  ...  to solve the open shop with fuzzy durations, and in [11] this genetic algorithm is combined with a local search method.  ... 
doi:10.1007/s11047-014-9413-1 fatcat:ne2ja3hcmzhkvgzmxfinbxtoou

Robust multiobjective optimisation for fuzzy job shop problems

Juan José Palacios, Inés González-Rodríguez, Camino R. Vela, Jorge Puente
2017 Applied Soft Computing  
In this paper we tackle a variant of the job shop scheduling problem with uncertain task durations modelled as fuzzy numbers.  ...  To optimise both the expected makespan and the predictive robustness of the fuzzy schedule we propose a multiobjective evolutionary algorithm combined with a novel dominance-based tabu search method.  ...  Acknowledgements This research has been supported by the Spanish Government under Grants FEDER TIN2013-46511-C2-2-P and MTM2014-55262-P.  ... 
doi:10.1016/j.asoc.2016.07.004 fatcat:ie66bcuxmnfh3grtgoacc7f6kq

Production Management of Multi-Objective Flexible Job-Shop Based on Improved PSO

C. L. Mao
2021 International Journal of Simulation Modelling  
However, the current studies have not solved the problem that the traditional PSO cannot apply to the production and processing environment with numerous uncertain changes.  ...  Then, the PSO was improved in terms of inertial weight, learning factors, global search ability, and local search ability, and the dynamic response mechanism was presented for the improved algorithm.  ...  For job-shop production control, the complexity of the problem increases with the number of parameters and constraints [22] [23] [24] [25] . He et al.  ... 
doi:10.2507/ijsimm20-2-co11 fatcat:h3zwbmto7ffe7fpjimfrbhrkoi

A neutrosophic number based memetic algorithm for the integrated process planning and scheduling problem with uncertain processing times

Liangliang Jin, Chaoyong Zhang, Xiaoyu Wen, George Gershom Christopher
2020 IEEE Access  
This research presents a novel perspective or methodology to seek more robust solutions for the uncertain IPPS problem.  ...  This research focuses on the IPPS problem with uncertain processing times to hedge against the uncertainty in makespan.  ...  Especially in scheduling problem optimizations, when a solution cannot be further optimized by a single local search technique, the VNS local search method provides a new perspective for further improvements  ... 
doi:10.1109/access.2020.2996496 fatcat:jbom24op4jcxlgynbdvpchtsaa

Solving Fuzzy Job-Shop Scheduling Problems with a Multiobjective Optimizer [chapter]

Thanh-Do Tran, Ramiro Varela, Inés González-Rodríguez, El-Ghazali Talbi
2014 Advances in Intelligent Systems and Computing  
In real-world manufacturing environments, it is common to face a job-shop scheduling problem (JSP) with uncertainty.  ...  In this paper, we investigate the use of a multiobjective genetic algorithm to address JSPs with uncertain durations.  ...  Job-Shop Scheduling with Uncertain Durations Crisp Job-Shop Scheduling Problems A general JSP [16] can be defined as scheduling a set of n jobs {J 1 , J 2 , · · · , J n } on a set of m physical resources  ... 
doi:10.1007/978-3-319-02821-7_19 fatcat:gtjqbpxxkzd6ffe2ji7td2a2ny

A genetic solution based on lexicographical goal programming for a multiobjective job shop with uncertainty

Inés González-Rodríguez, Camino R. Vela, Jorge Puente
2008 Journal of Intelligent Manufacturing  
In this work we consider a multiobjective job shop problem with uncertain durations and crisp due dates. Ill-known durations are modelled as fuzzy numbers.  ...  To solve the resulting problem, we propose a genetic algorithm searching in the space of possibly active schedules.  ...  A preliminary version of this work was presented at the Workshop on Planning, Scheduling and Constraint Satisfaction held in conjunction with CAEPIA 2007 (González Rodríguez et al., 2007a .  ... 
doi:10.1007/s10845-008-0161-x fatcat:4fhybv4wpjfinjuadch5ripbiu
« Previous Showing results 1 — 15 out of 11,820 results