Abstract

An integer programming model and optimal solution procedure are presented for assigning employees to the (10, 14) days-off schedule. This schedule is used by a large oil company to schedule employees in remote work locations. The primary objective is to minimize the total number of employees. Since employees are flown to their remote work sites, the company also aims to minimize transportation cost. Therefore, secondary objectives include (1) minimizing the number of active days-off work patterns, (2) consistently using the same set of active days-off patterns, (3) assigning work schedules fairly among employees, and (4) avoiding the use of specialized optimization solvers. A rotation schedule is used in which two scheduling rules are enforced: a minimum proportion of weekend days off needs to be given and a maximum limit on the number of successive workdays cannot be exceeded. Utilizing the problem structure, simple optimal procedures are developed to solve this unique complex scheduling problem.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.