Author
Jorge Puente
Other affiliations: Artificial Intelligence Center, Intel
Bio: Jorge Puente is an academic researcher from University of Oviedo. The author has contributed to research in topics: Job shop scheduling & Flow shop scheduling. The author has an hindex of 14, co-authored 55 publications receiving 620 citations. Previous affiliations of Jorge Puente include Artificial Intelligence Center & Intel.
Papers published on a yearly basis
Papers
More filters
TL;DR: The experimental results show that the performance of the genetic algorithm clearly augments when the initial population is seeded with heuristic chromosomes, the improvement being more and more appreciable as long as the size of the problem instance increases.
87 citations
TL;DR: An effective genetic algorithm hybridised with tabu search and heuristic seeding to minimise the total time needed to complete all jobs, known as makespan is proposed.
74 citations
TL;DR: This paper considers the berth allocation problem and the quay crane assignment problem as a representative example of scheduling problems where a typical objective is to minimize the service time and the robustness is introduced by means of buffer times that should be maximized to absorb possible incidences or breakdowns.
Abstract: Scheduling problems usually obtain the optimal solutions assuming that the environment is deterministic. However, actually the environment is dynamic and uncertain. Thus, the initial data could change and the initial schedule obtained might be unfeasible. To overcome this issue, a proactive approach is presented for scheduling problems without any previous knowledge about the incidences that can occur. In this paper, we consider the berth allocation problem and the quay crane assignment problem as a representative example of scheduling problems where a typical objective is to minimize the service time. The robustness is introduced within this problem by means of buffer times that should be maximized to absorb possible incidences or breakdowns. Therefore, this problem becomes a multi-objective optimization problem with two opposite objectives: minimizing the total service time and maximizing the robustness or buffer times.
45 citations
01 May 2008
TL;DR: The aim is to provide a semantics for this type of problems and use this semantics in a methodology to analyze, evaluate, and, therefore, compare solutions to find solutions.
Abstract: In the sequel, we consider the fuzzy job-shop problem, which is a variation of the job-shop problem where duration of tasks may be uncertain and where due-date constraints are allowed to be flexible. Uncertain durations are modeled using triangular fuzzy numbers, and due-date constraints are fuzzy sets with decreasing membership functions expressing a flexible threshold ldquoless than.rdquo Also, the objective function is built using fuzzy decision-making theory. We propose the use of a genetic algorithm (GA) to find solutions to this problem. Our aim is to provide a semantics for this type of problems and use this semantics in a methodology to analyze, evaluate, and, therefore, compare solutions. Finally, we present the results obtained using the GA and evaluate them using the proposed methodology.
44 citations
TL;DR: A new measure of overall due-date satisfaction in this setting is given and a neighbourhood structure for local search is defined, which is combined with a genetic algorithm, so the resulting memetic algorithm is run on a set of benchmarks.
43 citations
Cited by
More filters
[...]
TL;DR: There is, I think, something ethereal about i —the square root of minus one, which seems an odd beast at that time—an intruder hovering on the edge of reality.
Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.
Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …
33,785 citations
01 Jan 2007
TL;DR: Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches and Connections in Networks: Hardness of Feasibility Versus Optimality.
Abstract: Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches.- Connections in Networks: Hardness of Feasibility Versus Optimality.- Modeling the Regular Constraint with Integer Programming.- Hybrid Local Search for Constrained Financial Portfolio Selection Problems.- The "Not-Too-Heavy Spanning Tree" Constraint.- Eliminating Redundant Clauses in SAT Instances.- Cost-Bounded Binary Decision Diagrams for 0-1 Programming.- YIELDS: A Yet Improved Limited Discrepancy Search for CSPs.- A Global Constraint for Total Weighted Completion Time.- Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method.- Necessary Condition for Path Partitioning Constraints.- A Constraint Programming Approach to the Hospitals / Residents Problem.- Best-First AND/OR Search for 0/1 Integer Programming.- A Position-Based Propagator for the Open-Shop Problem.- Directional Interchangeability for Enhancing CSP Solving.- A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production.- Replenishment Planning for Stochastic Inventory Systems with Shortage Cost.- Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search.- The Deviation Constraint.- The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width.- On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint.- Solving a Stochastic Queueing Control Problem with Constraint Programming.- Constrained Clustering Via Concavity Cuts.- Bender's Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem.- A Large Neighborhood Search Heuristic for Graph Coloring.- Generalizations of the Global Cardinality Constraint for Hierarchical Resources.- A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems.
497 citations
TL;DR: This paper classify this new literature according to the features of models considered for berth allocation, quay crane scheduling and integrated approaches by using the classification schemes proposed in the preceding survey.
408 citations
TL;DR: This paper is the third comprehensive survey paper which provides an extensive review of about 500 papers that have appeared since the mid-2006 to the end of 2014, including static, dynamic, deterministic, and stochastic environments, based on shop environments as single machine, parallel machine, flowshop, job shop, or open shop.
369 citations
TL;DR: An effective hybrid algorithm which hybridizes the genetic algorithm (GA) and tabu search (TS) has been proposed for the FJSP with the objective to minimize the makespan and the experimental results demonstrate that the proposed HA has achieved significant improvement for solving FJ SP regardless of the solution accuracy and the computational time.
360 citations