MODELING A MODIFIED GENETIC ALGORITHM FOR PROJECT SCHEDULING SUBJECT TO PERISHABLE, NONRENEWABLE RESOURCES

This paper attempts to provide a solution for project scheduling problems subject to perishable, nonrenewable resources. The objective is to schedule activities, procurement and ordering so as to minimize the costs. We designed and employed an approach based on genetic algorithm (GA) to solve the problem. Chromosome structure is defined in indirect form with a size considerably smaller than all decision variables of the model. With a few genes, one can equate one point of the question space. In this algorithm we have offered an innovative method to generate initial population. Also, crossover and mutation operators use a combination of several methods with consideration to chromosome structure. Analysis of the results indicates that the proposed algorithm not only has a good convergence and consistency but also has a good efficiency in medium-size problems and finds optimal solution within a short time.

[1]  Sun Wei,et al.  Project Scheduling Under Resource Constraints: A Recent Survey , 2013 .

[2]  Haroldo Gambini Santos,et al.  New effective algorithm for Dynamic Resource Constrained Project Scheduling Problem , 2008 .

[3]  Willy Herroelen,et al.  Single-pass and approximate dynamic-programming algorithms for order acceptance and capacity planning , 2010, J. Heuristics.

[4]  Gerhard Friedrich,et al.  Applying Local Rescheduling in response to schedule disruptions , 2008, Ann. Oper. Res..

[5]  Nandyala Hemachandra,et al.  Perishable inventory management and dynamic pricing using RFID technology , 2005 .

[6]  Shahram Shadrokh,et al.  Branch and Bound Algorithms for Resource Constrained Project Scheduling Problem Subject to Cumulative Resources , 2011, 2011 International Conference on Information Management, Innovation Management and Industrial Engineering.

[7]  Borga Deniz,et al.  Essays on perishable inventory management , 2007 .

[8]  Willy Herroelen,et al.  Dynamic order acceptance and capacity planning on a single bottleneck resource , 2007 .

[9]  Erik Demeulemeester,et al.  Project scheduling : a research handbook , 2002 .

[10]  V. Jorge Leon,et al.  Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling , 1995 .

[11]  Klaus Neumann,et al.  Project scheduling with inventory constraints , 2003, Math. Methods Oper. Res..

[12]  Stephen F. Smith,et al.  A Constraint-Based Method for Project Scheduling with Time Windows , 2002, J. Heuristics.

[13]  David Naso,et al.  Reactive Scheduling of a Distributed Network for the Supply of Perishable Products , 2007, IEEE Transactions on Automation Science and Engineering.

[14]  Maged M. Dessouky,et al.  Perishable inventory management system with a minimum volume constraint , 2011, J. Oper. Res. Soc..

[15]  Chaaben Kouki,et al.  Perishable items Inventory Mnagement and the Use of Time Temperature Integrators Technology , 2010 .

[16]  Rainer Kolisch,et al.  PSPLIB - a project scheduling problem library , 1996 .

[17]  Philippe Laborie,et al.  Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results , 2003, Artif. Intell..

[18]  Norbert Trautmann,et al.  A MINLP/RCPSP decomposition approach for the short-term planning of batch production , 2005 .

[19]  Jacek Blazewicz,et al.  Scheduling in Computer and Manufacturing Systems , 1990 .

[20]  F. P. Scheer,et al.  RFID will help keep perishables fresh , 2005 .