Abstract
In this paper, a short-term manpower planning problem is considered where workers are grouped into gangs to support reliable and efficient operations. The goal is to minimise the total number of workers required by determining an appropriate gang structure, assignment of tasks to gangs, and schedule for each gang. We model such a problem as a multi-mode task scheduling problem with time windows and precedence constraints. While the gang structure and assignment of tasks is optimised by a tabu search heuristic, each gang's schedule is generated by solving the corresponding one-machine scheduling problem by an iterated Schrage heuristic. Because the evaluation of a tabu search move is computationally expensive, we propose a number of ways to estimate a move's impact on the solution quality.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Blażewicz, J. and Liu, Z. (1996) Scheduling multiprocessor tasks with chain constraints. European Journal of Operational Research, 94:231–241.
Bramel, J. and Simchi-Levi, D. (1997) The Logic of Logistics. Operations Research Series. Springer, Berlin.
Brucker, P., Drexl, A., Möhring, R., Neumann, K., and Pesch, E. (1999) Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research, 112:3–41.
Carlier, J. (1982) The one-machine scheduling problem. European Journal of Operational Research, 11:42–47.
Dodin, B., Elimam, A. A., and Rolland, E. (1998) Tabu search in audit scheduling. European Journal of Operational Research, 106:373–392.
Drozdowski, M. (1996) Scheduling multiprocessor tasks—an overview. European Journal of Operational Research, 94:215–230.
Feitelson, D. G. (1996) Packing schemes for gang scheduling. In Feitelson, D. G. and Rudolph, L. (Eds.), Job Scheduing Strategies for Parallel Processing, Lecture Notes in Computer Science, Vol. 1162, Springer, Berlin, pp. 89–110.
Glover, F. and Laguna, M. (1993) Tabu search. In Reeves, Colin R. (Ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell, Oxford, pp. 70–150.
Mattfeld, D. C. and Kopfer, H. (2003) Terminal operations management in vehicle transshipment. Transportation Research A, 37.
Salewski, F., Schirmer, A., and Drexl, A. (1997) Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application. European Journal of Operational Research, 102:88–110.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this paper
Cite this paper
Mattfeld, D.C., Branke, J. (2005). Task Scheduling Under Gang Constraints. In: Kendall, G., Burke, E.K., Petrovic, S., Gendreau, M. (eds) Multidisciplinary Scheduling: Theory and Applications. Springer, Boston, MA. https://doi.org/10.1007/0-387-27744-7_6
Download citation
DOI: https://doi.org/10.1007/0-387-27744-7_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-25266-7
Online ISBN: 978-0-387-27744-8
eBook Packages: Business and EconomicsBusiness and Management (R0)