AJOR  Vol.5 No.3 , May 2015
Maintenance Task Scheduling, Reaching a Twofold Objective
ABSTRACT
In this paper, the problem of maintenance task scheduling is tackled with a twofold objective: meeting the performance criteria of a company and taking into account some operators’ requirements. The production manager makes sure that makespan is optimised while developing operators’ flexibility. The use of skill matrixes enables him to make pairs and to develop training in order to make trainees more autonomous. Operators’ requirements are in particular related to periods of unavailability and their wishes relating to their tasks. Given the complexity of the problem, an exact solution isn’t conceivable and our research focuses on a metaheuritic method giving us a solution that is considered satisfactory. A multi-criteria analysis of the results is performed in order to reach a compromise among conflicting goals.

Cite this paper
Boschian-Campaner, V. (2015) Maintenance Task Scheduling, Reaching a Twofold Objective. American Journal of Operations Research, 5, 179-191. doi: 10.4236/ajor.2015.53014.
References
[1]   Blazewicz, J., Lenstra, J.K. and Rinnoy Kan, A.H.G. (1983) Scheduling Projects Subject to Resource Constraints: Classification and Complexity. Discrete Applied Mathematics, 5, 11-24.

[2]   Brucker, P., Drexl, A., Morhing, R., Neumann, K. and Pesch, E. (1999) Resource Constrained Project Scheduling Problem: Notation, Classification, Models and Methods. European Journal of Operational Research, 112, 3-41.

[3]   Herroelen, W. and Leus, R. (2005) Project Scheduling under Uncertainty—Survey and Research Potentials. European Journal of Operational Research, 165, 289-306.

[4]   Aytug, H., Lawley, M., McKay, K., Mohan, S. and Uzsoy, R. (2005) Executing Production Schedules in the Face of Uncertainties: A Review and Some Future Directions. European Journal of Operational Research, 161, 86-110.
http://dx.doi.org/10.1016/j.ejor.2003.08.027

[5]   De Reyck, B. and Herroelen, W. (1999) The Multi-Mode Resource-Constrained Project Scheduling Problem with Generalized Precedence Relations. European Journal of Operational Research, 119, 538-556.

[6]   Bellenguez-Morineau, O. (2006) Méthodes de résolution pour un problème de gestion de projet avec prise en compte de compétences. Thèse de Doctorat, Université Fran?ois, Rabelais de Tours, France.

[7]   Drezet, L.-E. and Billaut, J.-C. (2008) A Project Scheduling Problem with Labour Constraints and Time-Dependent Activities Requirements. International Journal of Production Economics, 112, 217-225.
http://dx.doi.org/10.1016/j.ijpe.2006.08.021

[8]   Burleson, R.C., Hass, C.T., Tucker, R.L. and Stanley, A. (1998) Multi-Skilled Labor Utilization Strategies in Construction. Journal of Construction Engineering and Management, 124, 480-489.
http://dx.doi.org/10.1061/(ASCE)0733-9364(1998)124:6(480)

[9]   Kacem, I. (2005) Minimising the Sum of the Completion Time with Availability Constraint: Comparison of Branch and Bound Method and Integer Linear Programming. IESM’05, Marrakech, 16-19 May 2005, 16-19.

[10]   Artigues, C., Michelon, P. and Reusser, S. (2003) Insertion Techniques for Static and Dynamic Resource-Constrained Project Scheduling. European Journal of Operational Research, 149, 249-267.
http://dx.doi.org/10.1016/S0377-2217(02)00758-0

[11]   Sprecher, A. and Drexl, A. (1998) Multi-Mode Resource-Constrained Project Scheduling with a Simple, General and Powerful Sequencing Algorithm. European Journal of Operational Research, 107, 431-450.
http://dx.doi.org/10.1016/S0377-2217(97)00348-2

[12]   Zhu, G., Bard, J. and Tu, G. (2006) A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem. Journal on Computing, 18, 377-390.
http://dx.doi.org/10.1287/ijoc.1040.0121

[13]   Kolisch, R. and Drexl, A. (1997) Local Search for Nonpreemptive Multi-Mode Resource Constrained Project Scheduling. IIE Transactions, 29, 987-999.
http://dx.doi.org/10.1080/07408179708966417

[14]   Lova, A., Tormos, P. and Barber, F. (2006) Multi-Mode Resource Constrained Project Scheduling: Scheduling Schemes, Priority Rules and Mode Selection Rules. Inteligencia Artificial, 30, 69-86.
http://dx.doi.org/10.4114/ia.v10i30.947

[15]   Van Peteghen, V. and Vanhoucke, M. (2010) A Genetic Algorithm for the Preemptive and Non-Preemtive Multi-Mode Resource-Constrained Project Scheduling Problem. European Journal of Operational Research, 201, 409-418.
http://dx.doi.org/10.1016/j.ejor.2009.03.034

[16]   Nembhard, D.A. and Uzumeri, M.V. (2000) Experimental Learning and Forgetting for Manual and Cognitive Task. International Journal of Industrial Ergonomics, 25, 315-326.
http://dx.doi.org/10.1016/S0169-8141(99)00021-9

[17]   Manne, A.S. (1960) On the Job-Shop Scheduling Problem. Operations Research, 8, 219-223.
http://dx.doi.org/10.1287/opre.8.2.219

[18]   Vilcot, G., Kergosien, Y., Janvier, J. and Billaut, J.C. (2008) Une recherche tabou et un algorithme génétique pour un problème de job shop multi ressource multicritère. Proceedings of the 7th Conférence Internationale de MOdélisation et SIMulation, Paris, 31 mars-2 avril 2008, 858-867.

[19]   Brinkkötter, W. and Brucker, P. (2001) Solving Open Benchmark Instances for the Job Shop Problem by Parallel Head-Tail Adjustments. Journal of Scheduling, 4, 53-64.
http://dx.doi.org/10.1002/1099-1425(200101/02)4:1<53::AID-JOS59>3.0.CO;2-Y

[20]   Charles, D. (1859) The Origin of Species. John Murray, London.

[21]   Holland, J.H. (1975) Adaptation in Natural and Artificial System. The University of Michigan Press, Ann Arbor.

[22]   Goldberg, D.E. (1989) Genetic Algorithms in Search, Optimisation and Machines Learning. Addison-Wesley, Boston.

[23]   Adams, J., Balas, E. and Zawack, D. (1988) The Shifting Bottleneck Procedure for Job Shop Scheduling. Management Science, 34, 391-401.
http://dx.doi.org/10.1287/mnsc.34.3.391

[24]   Harrington Jr., E.C. (1965) The Desirability Function. Industrial Quality Control, 21, 494-498.

[25]   Derringer, G. and Suich, R. (1980) Simultaneous Optimization of Several Response Variables. Journal of Quality Technology, 12, 214-219.

 
 
Top