Hence, heuristic development for such problem is highly inevitable. This problem of minimizing the makespan in single machine scheduling problem with uniform parallel machines is NP hard. ![]() Makespan, Simulated Annealing Algorithm, GRASP, Unrelated Parallel Machines, Mathematical ModelĪBSTRACT: 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. ![]() ![]() Panneerselvam, “Production and Operations Management,” 2nd Edition, PHI Learning Private Limited, New Delhi, 2005.ĭesign and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel MachinesĪUTHORS: Panneerselvam Sivasankaran, Thambu Sornakumar, Ramasamy Panneerselvam
0 Comments
Leave a Reply.AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |