Theoreticalandpracticalfundamentalsformulti-objectiveoptimisationin resource-constrainedprojectschedulingproblems

Projectschedulingisaninherentlymulti-objectiveproblem,sincemanagerswanttofinishprojectsas soonaspossiblewiththeminimumcostandthemaximumquality.However,thereareonlyafew papersdealingwithmultiobjectiveresource-constrainedprojectschedulingproblems(MORCPSPs). Moreover,thereisnotheoreticalstudyintheliteraturethatestablishesthefundamentalsforcorrect algorithmicdevelopments.Inthispaperwetrytoclosethegapbyprovingseveralresultsfor MORCPSPs.Withtheseresultsasabasis,bothexactandheuristicprocedurescapableofobtainingaset of efficientsolutionsforseveralimportantMORCPSPscanbecreated. We developalgorithmsforthecasewhereallobjectivefunctionsareofthesametype,called regular.Inthiscase,specificcodifications,techniques,andprocedurescanbeused.Extensive computationalresultshelpdecidewhichalgorithmsortechniquesarethemostpromisingforthe problem.WiththeaidofthesealgorithmswestudytheParetofrontsinthiscase.Finally,weapplya metaheuristicalgorithmtoaparticularexampleofthegeneralcaseinordertoanalysethedifferences in theParetofronts. The projectinstancesandParetofrontsobtainedcanbedownloadedfromawebsitetofacilitate comparisonswithfutureresearchefforts.