Buscar
Mostrando ítems 1-10 de 87
ACO-based dynamic job scheduling of parametric computational mechanics studies on Cloud Computing infrastructures
(IOS Press, 2013)
Parameter Sweep Experiments (PSEs) allow scientists to perform simulations by running the same code with different input data, which typically results in many CPU-intensive jobs and thus computing environments such as ...
An effective MILP-based decomposition algorithm for the scheduling and redesign of flexible job-shop plants
(Italian Association of Chemical Engineering, 2019-06)
This paper presents a decomposition algorithm for the integrated scheduling and redesign problem of a multistage batch plant dealing with multipurpose units and heterogeneous recipes. First, the procedure solves the ...
Simple Energy Aware Scheduler: An Empirical Evaluation
(CLEI, 2018-08)
Mobile devices have evolved from single purpose devices, such as mobile phone, into general purpose multi-core computers with considerable unused capabilities. Therefore, several researchers have considered harnessing the ...
Production scheduling and lot streaming at flexible job-shops environments using constraint programming
(Pergamon-Elsevier Science Ltd, 2019-10)
In this contribution, the scheduling at flexible job-shops and the lot streaming problem are simultaneously addressed, by means of a novel Constraint Programming (CP) approach. The proposed CP model can efficiently tackle ...
Schedulers based on Ant Colony Optimization for Parameter Sweep Experiments in Distributed Environments
(International Gemological Institute, 2013)
Scientists and engineers are more and more faced to the need of computational power to satisfy the ever-increasing resource intensive nature of their experiments. An example of these experiments is Parameter Sweep Experiments ...
A simple dierential evolution algorithm to solve the flexible job shop scheduling problem
(Universidad Nacional de Rio Cuarto. Facultad de Ciencias Exactas, Físico-Químicas y Naturales. Departamento de Computación, 2019)
This paper addresses the Flexible Job Shop Scheduling Problem (FJSSP) where the objective is to minimize the makespan. We develop a parallel hybrid Differential Evolution (DE) algorithm to tackle this problem. A random key ...
Applying MILP/Heuristic Algorithms to Automated Job-Shop Scheduling Problems in Aircraft-Part Manufacturing
(Universidad Federal de Santa Catarina. Centro Tecnológico. Programa de Postgrado en Ingeniería de Producción, 2014-04)
This work presents efficient algorithms based on Mixed-Integer LinearProgramming (MILP) and heuristic strategies for complex job-shop scheduling problemsraised in Automated Manufacturing Systems. The aim of this work is ...
Scheduling a Job Shop with a BPM Using Simulated Annealing. Proceedings of Industrial Engineering Research Conference (ISERC)
(Inst of Industrial Engineers; Cdr edition, 2012-05-23)
We consider a scheduling problem commonly observed in the metal working industry. We analyze a job shop which is equipped with one batch processing machine (BPM)
A non-permutation flowshop scheduling problem with lot streaming: A mathematical model
(Growing Science, 2016-06)
In this paper we investigate the use of lot streaming in non-permutation flowshop scheduling problems. The objective is to minimize the makespan subject to the standard flowshop constraints, but where it is now permitted ...