Andere Kunden interessierten sich auch für
![MINIMIZING IDLE TIME OF SELECTED MACHINES IN FLOWSHOP PROBLEMS]( "MINIMIZING IDLE TIME OF SELECTED MACHINES IN FLOWSHOP PROBLEMS")
MINIMIZING IDLE TIME OF SELECTED MACHINES IN FLOWSHOP PROBLEMS29,99 €![Stock Market Analysis Using Combined Intra-Inter Transaction Algorithm]( "Stock Market Analysis Using Combined Intra-Inter Transaction Algorithm")
Stock Market Analysis Using Combined Intra-Inter Transaction Algorithm29,99 €![Scheduling and routing of vehicles]( "Scheduling and routing of vehicles")
Scheduling and routing of vehicles32,99 €![Using The NewsInn Algorithm To Predict Stock Market Movements Two Days In Advance]( "Using The NewsInn Algorithm To Predict Stock Market Movements Two Days In Advance")
Using The NewsInn Algorithm To Predict Stock Market Movements Two Days In Advance17,95 €![Re-scheduling Television in the Digital Era]( "Re-scheduling Television in the Digital Era")
Re-scheduling Television in the Digital Era74,99 €![Truck Scheduling for Parcel Hubs with Limited Conveyor Capacities]( "Truck Scheduling for Parcel Hubs with Limited Conveyor Capacities")
Truck Scheduling for Parcel Hubs with Limited Conveyor Capacities8,99 €![Management logistischer Netzwerke]( "Management logistischer Netzwerke")
Management logistischer Netzwerke114,99 €
As known, it is not possible to develop an algorithm that can compute the exact value of the minimum makespan on identical parallel machines in polynomial time. Therefore heuristic methods are convenient to find near optimal solutions. In this thesis, it is aimed to compose a new heuristic algorithm to minimize the makespan on identical parallel machines. This algorithm can present better solutions than LPT (Longest Processing Time) algorithm in general. The computer models of the proposed and LPT algorithms are developed. 1640 different problems are solved using the two models to compare the performances of the algorithms. Numbers of jobs, numbers of machines or the mean of processing times are changed one at a time, while keeping the rest constant and, the variation in the makespan is observed. Finally it is concluded that there is sufficient evidence that the proposed algorithm provides better solutions than LPT in the light of the data collected from the uniform distribution.The proposed algorithm is also modified to the probabilistic cases.