Abstract
In this paper we describe a new approach for solving the shift minimisation personnel task scheduling problem. This variant of fixed job scheduling problems arises when tasks with fixed start and end times have to be assigned to personnel with shift time constraints. We present definitions, formulations and briefly discuss complexity results for the variant that focuses on minimising the number of machines (or workers) that are required to schedule all jobs. We first develop some mathematical properties of the problem and subsequently, the necessary and sufficient conditions for feasibility. These properties are used to develop a new branch and bound scheme, which is used in conjunction with two column generation based approaches and a heuristic algorithm to create an efficient solution procedure. We present extensive computational results for large instances and thereby, empirically demonstrate the effectiveness of our new approach.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bekki, O., Azizoglu, M.: Operational fixed interval scheduling problem on uniform parallel machines. Int. J. Prod. Econ., 756–768 (2008)
Desrosiers, J., Lübbecke, M.E.: A primer in column generation. Springer (2005)
Eliiyi, D., Azizoglu, M.: Working time constraints in operational fixed job scheduling. Int. J. Prod. Res., 6211–6233 (2010)
Fischetti, M., Martello, S., Toth, P.: The fixed job schedule problem with working-time constraints. Operations Research 37(3), 395–403 (1989)
Ghouila-Houri, A.: Charactérisations des matrices totalement unimodulaires. Comptes Rendus de l’Acadmie des Sciences 254, 1192–1194 (1962)
Gupta, U.I., Lee, D.T., Leung, J.Y.T.: Efficient algorithms for interval graphs and circular-arc graphs. Networks 12(4), 459–467 (1982)
Kolen, A.W.J., Lenstra, J.K., Papadimitriou, C.H., Spieksma, F.C.R.: Interval scheduling: A survey. Naval Research Logistics 54(5), 530–543 (2007)
Kovalyov, M., Ng, C., Cheng, T.: Fixed interval scheduling: models, applications, computational complexity and algorithms. European J. of O.R., 331–342 (2007)
Krishnamoorthy, M., Ernst, A.T.: The personnel task scheduling problem. In: Yang, X., Teo, K.L., Caccetta, L. (eds.) Optimization Methods and Applications, pp. 343–368. Kluwer Academic Publishers (2001)
Krishnamoorthy, M., Ernst, A.T., Baatar, D.: Algorithms for large scale shift minimisation personnel task scheduling problems. European Journal of Operational Research 219, 34–48 (2012)
Kroon, L.G., Salomon, M., Van Wassenhove, L.N.: Exact and approximation algorithms for the tactical fixed interval scheduling problem. Operations Research 45(4), 624–638 (1997)
Krumke, S.O., Thielen, C., Westphal, S.: Interval scheduling on related machines. Computers & Operations Research 38(12), 1836–1844 (2011)
Lin, S.W., Ying, K.C.: Minimizing shifts for personnel task scheduling problems: A three-phase algorithm. European J. of Op. Research 237(1), 323–334 (2014)
Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. John Wiley & Sons, Inc. (1988)
Rossi, A., Singh, A., Sevaux, M.: A metaheuristic for the fixed job scheduling problem under spread time constraints. Computers & O.R. 37(6), 1045–1054 (2010)
Schrijver, A.: Theory of Linear and Integer Programming. Wiley & Sons (1986)
Smet, P., Berghe, G.V.: A matheuristic approach to the shift minimisation personnel task scheduling problem. In: Proc. of the 9th Int. Conf. on the Practice and Theory of Automated Timetabling (PATAT), Son, Norway, pp. 145–160 (August 2012)
Smet, P., Wauters, T., Mihaylov, M., Berghe, G.V.: The shift minimisation personnel task scheduling problem: A new hybrid approach and computational insights. Omega 46, 64–73 (2014)
Solyali, O., Ozpeynirci, O.: Operational fixed job scheduling problem Under spread time constraints: a branch-and-price algorithm. Int. J. Prod. Res., 1877–1893 (2009)
Solyali, O., Özpeynirci, O.: Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm. International Journal of Production Research 47(7), 1877–1893 (2009)
Türsel Eliiyi, D., Azizolu, M.: Heuristics for operational fixed job scheduling problems with working and spread time constraints. International Journal of Production Economics 132(1), 107–121 (2011)
Zhou, S., Zhang, X., Chen, B., Velde, S.v.d.: Tactical fixed job scheduling with spread-time constraints. Computers & Operations Research, 53–60 (2014)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baatar, D., Krishnamoorthy, M., Ernst, A.T. (2015). A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem. In: Bansal, N., Finocchi, I. (eds) Algorithms - ESA 2015. Lecture Notes in Computer Science(), vol 9294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48350-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-48350-3_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48349-7
Online ISBN: 978-3-662-48350-3
eBook Packages: Computer ScienceComputer Science (R0)