The Shift Minimization Personnel Task Scheduling Problem: An Effective Lower Bounding Procedure

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Hacettepe Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi
Volume:34 Issue:2
The Shift Minimization Personnel Task Scheduling Problem: An Effective Lower Bounding Procedure

The Shift Minimization Personnel Task Scheduling Problem: An Effective Lower Bounding Procedure

Pages : 115-132

View : 45 | Download : 13

Publication Date : 2016-06-23

Article Type : Research Paper

Abstract :This study considers the shift minimization personnel task scheduling problem, which is to assign a set of tasks with fixed start and finish times to a minimum number of workers from a heterogeneous workforce. An effective lower bounding procedure based on solving a new integer programming model of the problem is proposed for the problem. An extensive computational study on benchmark data sets reveals that the proposed lower bounding procedure outperforms those existing in the literature and consistently and rapidly yields high quality lower bounds that are necessary for the decision makers to assess the quality of the obtained schedules.
Keywords : scheduling, integer programming

ORIGINAL ARTICLE URL

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.