Research On Project Schedule Deadline Constraint Satisfaction Problem Based On Line Of Balance

The repetitive project deadline constrain satisfaction problem refers to the minimum cost for a contract duration,since taking into account of the duration and cost,such problems have a higher value.The traditional repetitive project deadline constrain satisfaction algorithm mainly take measures of accelerate the positive controlling a ctivity to compression the total duration,such approach would have a greater total cost.Since delay negative controlling activity can compression the total duration too,therefore,this article adds measure of delay negative controlling activity,can spe nd less resource cost to compressing the total duration.In addition,introduction learning effect to repetitive project scheduling,the resulting scheduling will be close to the actual scheduling.Firstly,this paper introduces the line of balance(LOB)t echnology which will represent repetitive project in this paper.Analyzes the representation of LOB,LOB calculation method and LOB diagramming method,and a simple method to find the controlling activities is provided,it will provide a theoretical basis for later.Secondly,this paper given a model and algorithm which applicable to the ordinary LOB deadline constrain satisfaction problem.Algorithm taking two methods into account,can reduce the use of resources.The algorithm can effectively solve the re petitive project deadline constrain problem without considering the learning effect,a numerical example show the advantages of the algorithm.Then,since learning effect is a common phenomenon in repetitive projects,based on the aforementioned algorithm,and combine the learning effects model proposed in this paper,the LOB scheduling deadline constraint satisfaction consider learning effect model was developed.Compared to the traditional methods,the new model will optimize two type controlling activities,and use the improved genetic algorithms,adjustment the number of construction unit of the crew for each activity.Every step,the adjustment program will be taken which rate of duration compression costs is minimum,guarantee the total cost of the project is least when achieve the purpose of contract duration.Finally,the data of a project is used to checking the algorithm of LOB scheduling deadline constraint satisfaction consider learning effect.The numerical example show the advantages of the algorithm.Traditional CPM scheduling technology is still the main used of technology in the field of engineering,however,this technology has many deficiencies when dealing with repetitive projects.The LOB deadline constraint satisfaction algorithm and LOB deadline constraint satisfaction algorithm consider learning effect proposed in this paper is based on LOB technology,it will have a certain significance.The numerical examples showed that considering optimize the negative controlling activities,and take which duration compression costs is minimum in every adjustment,the contract duration will be obtained corresponds to the minimum total cost.Moreover,introduce learning effect to repetitive project scheduling,the resulting scheduling will be close to the actual scheduling.Thus,the research of this paper will have some theoretical and practical significance.