Learn More
We propose a hybrid method designed to solve a problem of dispatching and conflict free routing of automated guided vehicles (AGVs) in a flexible manufacturing system (FMS). This problem consists in the simultaneous assignment, scheduling and conflict free routing of the vehicles. Our approach consists in a decomposition method where the master problem(More)
Winter road maintenance planning involves a variety of decision-making problems related to the routing of vehicles for spreading chemicals and abrasives, for plowing roadways and sidewalks, for loading snow into trucks, and for transporting snow to disposal sites. These problems are very difficult and site specific because of the diversity of operating(More)
This is a summary of the journal article (Malapert et al. 2012) published by Journal on Computing entitled " An Optimal Constraint Programming Approach to the Open-Shop Problem ". The article presents an optimal constraint programming approach for the Open-Shop scheduling problem, which integrates recent constraint propagation and branching techniques with(More)