An improved ant colony algorithm for the job shop scheduling problem

Para el estudio de este tipo de singularidades en el problema de Muskat, consideraremos el caso unif´ asico, esto es, un ´ unico fluido en el vac´ıo con µ 1 = ρ 1 = 0.. Grosso modo,

All these models are trained by minimizing an error term plus a regularization term, and thus they fit nicely in the domain of PMs, as the structure of the problem can be exploited

To do this, we first obtain numerical evidence (see Section 13.2 in Chapter 13) and then we prove with a computer assisted proof (see Section 13.4) the existence of initial data

In [1], the authors exploited the fact that for H¨older doubling measures the points in the support “almost” satisfy a quadratic equation.. More precisely they satisfy a

selection and the best parameters are used to solve the Job-Shop Scheduling Problem through the Traveling Salesman Problem.. Different cases in the literature are solved to

Currently, he is a Professor of the Advanced Research in Industrial Engineering Centre at the Autonomous University of Hidalgo State at Pachuca, Hidalgo, México. His

Van Bee, (2005), Water Resources Systems Planning and Management: An Introduction to Methods, Models and Applications, Studies and Reports in Hydrology, ISBN 92-3-103998-9,

Improving the Multi-Restart Local Search Algorithm by Permutation Matrices and Sorted Completion Times for the Flow Shop Scheduling