Open Access. Powered by Scholars. Published by Universities.®

Operations Research, Systems Engineering and Industrial Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Series

University of New Haven

Mechanical and Industrial Engineering Faculty Publications

Constraint programming

Articles 1 - 2 of 2

Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering

A Constraint Programming Approach For The Team Orienteering Problem With Time Windows, Ridvan Gedik, Emre Kirac, Ashlea Bennet Milburn, Chase Rainwater May 2017

A Constraint Programming Approach For The Team Orienteering Problem With Time Windows, Ridvan Gedik, Emre Kirac, Ashlea Bennet Milburn, Chase Rainwater

Mechanical and Industrial Engineering Faculty Publications

The team orienteering problem with time windows (TOPTW) is a NP-hard combinatorial optimization problem. It has many real-world applications, for example, routing technicians and disaster relief routing. In the TOPTW, a set of locations is given. For each, the profit, service time and time window are known. A fleet of homogenous vehicles are available for visiting locations and collecting their associated profits. Each vehicle is constrained by a maximum tour duration. The problem is to plan a set of vehicle routes that begin and end at a depot, visit each location no more than once by incorporating time window constraints ...


Analysis Of A Parallel Machine Scheduling Problem With Sequence Dependent Setup Times And Job Availability Intervals, Ridvan Gedik, Chase Rainwater, Heather Nachtmann, Edward A. Pohl Jun 2016

Analysis Of A Parallel Machine Scheduling Problem With Sequence Dependent Setup Times And Job Availability Intervals, Ridvan Gedik, Chase Rainwater, Heather Nachtmann, Edward A. Pohl

Mechanical and Industrial Engineering Faculty Publications

In this study, we propose constraint programming (CP) model and logic-based Benders algorithms in order to make the best decisions for scheduling non-identical jobs with availability intervals and sequence dependent setup times on unrelated parallel machines in a fixed planning horizon. In this problem, each job has a profit, cost and must be assigned to at most one machine in such a way that total profit is maximized. In addition, the total cost has to be less than or equal to a budget level. Computational tests are performed on a real-life case study prepared in collaboration with the U.S ...