Operations Research, Systems Engineering and Industrial Engineering Commons^™

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. Army …