This paper discusses design and comparison of Simulated Annealing Algorithm and Greedy Randomized Adaptive Search Procedure (GRASP) to minimize the makespan in scheduling n single operation independent jobs on m unrelated parallel machines. This problem of minimizing the makespan in single machine scheduling problem with uniform parallel machines is NP hard. Hence, heuristic development for suc...

Traditionally, machine scheduling research has focused only on efficiently assigning machine-time to jobs. It has not addressed the issue of how the jobs reach the machine from their originating source or how the finished jobs are delivered to their customers. In reality, the transportation time is substantial and hence cannot be ignored. Most of these variants are N P -hard. The scheduling pro...

We address the problem of minimizing the total weighted completion time in stochastic machine scheduling. A set of jobs has to be processed on identical parallel machines, job processing times are drawn from some known probability distribution, and the aim is to find a scheduling strategy that minimizes the objective in expectation. The overall driving question is: What is the performance of si...

tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. hence, integration has been proposed to decide about these problems concurrently. main problem in integration is how we can relate pro...

nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. in some of the applications of unrelated parallel mac...