The referee assignment problem in sports scheduling is addressed for the First Division of the Chilean professional football league using integer linear programming. Various criteria that enhance the transparency and objectivity of the assignment process are considered. As well as better balances in the number of matches each referee must officiate, the frequency each is assigned to a given tea...

A hybrid Mixed-Integer Linear Programming (MILP)/Constraint Programming (CP) decomposition algorithm is proposed for the short-term scheduling of batch plants that rely on the State Task Network representation. The decisions about the type and number of tasks performed, as well as the assignment of units to tasks are made by the MILP master problem. The CP subproblem checks the feasibility of a...

This paper addresses a new mixed integer nonlinear and linear mathematical programming economic lot sizing and scheduling problem in distributed permutation flow shop problem with number of identical factories and machines. Different products must be distributed between the factories and then assignment of products to factories and sequencing of the products assigned to each factory has to be d...

This study considers a class of two-machine flow-shop scheduling problems with job delivery coordination. Both vehicle capacity and transportation times are also investigated. The objective is to minimize the mean arrival time of jobs. Two integer programming models are developed to optimally solve this problem. These two integer programming models are Models 1 and 2. Model 1 adopts the concept...

We study an assignment type resource-constrained project scheduling problem with resources being multi-skilled personnel to minimize the total staffing costs. We develop a hybrid Benders decomposition (HBD) algorithm that combines the complimentary strengths of both mixed-integer linear programming (MILP) and constraint programming (CP) to solve this NP-hard optimization problem. An effective c...

High School Timetabling (HSTT) is a well known and widespread problem. The problem consists of coordinating resources (e.g. teachers, rooms), times, and events (e.g. lectures) with respect to various constraints. Unfortunately, HSTT is hard to solve and just finding a feasible solution for simple variants of HSTT have been proven to be NP-complete. In this work, we consider the general HSTT pro...

This study aims to solve the scheduling problem arising from oxide– nitride–oxide (ONO) stacked film fabrication in semiconductor manufacturing. This problem is characterized by waiting time constraints, frequency-based setups, and capacity preoccupation. To the best of our knowledge, none of the existing studies has addressed constrained waiting time and frequency-based setups at the same time...