A 0–1 goal programming model for scheduling multiple maintenance projects at a copper mine

Abstract This paper describes the application of 0–1 goal programming (GP) in multi-project resource-constrained scheduling for the maintenance of mineral-processing equipment at a copper mine in China. This involves four projects, 40 jobs and nine types of resources. We first develop a generalized 0–1 GP model. Because of the limited computing capacity at the mine, an effective two-phase hybrid solution approach is then proposed. In Phase I, under resource constraints, a feasible schedule is obtained by a heuristic. Based on this feasible schedule and a model-simplification procedure, many decision variables in the generalized model are eliminated and redundant constraints are removed. (Although this procedure is particularly designed for this mine, we also discuss its extension to general problems.) In Phase II, the streamlined model is solved by implicit enumeration. This approach eliminates 90% of the variables and 96% of the constraints in the problem we studied. We are thus able to solve a multi-project scheduling problem of medium size on a PC. In comparison with the heuristic method that the mine was using, our hybrid approach reduced project duration by 13%, total project cost by 30%, cost for the critical project by 15%, and overall workload by 59%.

[1]  Edward L. Hannan,et al.  The application of goal programming techniques to the CPM problem , 1978 .

[2]  Manuel Pete Spinner.  Elements Of Project Management: Plan, Schedule, And Control , 1991 .

[3]  I. Kurtulus,et al.  Multi-Project Scheduling: Categorization of Heuristic Rules Performance , 1982 .

[4]  Edward W. Davis,et al.  A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling , 1975 .

[5]  Richard F. Deckro,et al.  A heuristic for multi-project scheduling with limited resources in the housing industry , 1990 .

[6]  Laurence J. Moore,et al.  Analysis of a multi-criteria project crashing model , 1978 .

[7]  Edward W. Davis,et al.  Project Scheduling under Resource Constraints—Historical Review and Categorization of Procedures , 1973 .

[8]  Roger M. Y. Ho,et al.  Goal programming and extensions , 1976 .

[9]  E. Ritchie.  Network Based Planning Techniques: A Critical Review of Published Developments , 1985 .

[10]  F. F. Boctor,et al.  Some efficient multi-heuristic procedures for resource-constrained project scheduling , 1990 .

[11]  R. Słowiński.  Multiobjective network scheduling with efficient use of renewable and nonrenewable resources , 1981 .

[12]  Jan Węglarz,et al.  Project Scheduling with Continuously-Divisible, Doubly Constrained Resources , 1981 .

[13]  F. Brian Talbot,et al.  Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case , 1982 .

[14]  Subhash C. Narula,et al.  Multi-Project Scheduling: Analysis of Project Performance , 1985 .

[15]  Willy Herroelen,et al.  Resource-constrained Project Scheduling — The State of the Art , 1972 .

[16]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[17]  Robert J Willis.  Critical path analysis and resource constrained project scheduling -- Theory and practice , 1985 .

[18]  L. A. Smith,et al.  Estimating: The input into good project planning , 1985, IEEE Transactions on Engineering Management.

[19]  Philip M. Wolfe,et al.  Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach , 1969 .