Solving Single Machine Total Weighted Tardiness Problem using Variable Structure Learning Automata

• Published in: International journal of computer applications 2012-01, Vol.56 (1), p.37-42
• Main Authors: Sabamoniri, Saeed, Asghari, Kayvan, Hosseini, Mohammad Javad
• Format: Article
• Language: English
• Subjects: Algorithms; Automation; Computer simulation; Delay; Learning; Mathematical models; Scheduling; Variable structure
• ISSN: 0975-8887; 0975-8887
• DOI: 10.5120/8858-2816

In this paper intelligent search technique of variable structure learning automata (VSLA) has been used to solve single machine total weighted tardiness job scheduling problem. The goal is investigating reduction in delays result in late execution of the jobs after specified deadline as well as reducing the time required to find the best execution order of the jobs. For this reason, fixed structure learning automata and genetic algorithm approaches has been studied and then a new scheduling approach called VSLA-Scheduler has been proposed by employing variable structure learning automata technique. In order to identify strengths and weaknesses of the proposed method, its performance is compared with other intelligent techniques. In this regard, for performance evaluation of the proposed method and comparing it with other methods, computer simulations have been used. Finally, the results produced by the proposed and previous algorithms have been compared with the best solutions in OR library. Experimental results show that the proposed algorithm's performance (VSLA-Scheduler) is more acceptable than other methods.