@article{(Open Science Index):https://publications.waset.org/pdf/11398,
	  title     = { Multiple Job Shop-Scheduling using Hybrid Heuristic Algorithm },
	  author    = {R.A.Mahdavinejad},
	  country	= {},
	  institution	= {},
	  abstract     = {In this paper, multi-processors job shop scheduling problems are solved by a heuristic algorithm based on the hybrid of priority dispatching rules according to an ant colony optimization algorithm. The objective function is to minimize the makespan, i.e. total completion time, in which a simultanous presence of various kinds of ferons is allowed. By using the suitable hybrid of priority dispatching rules, the process of finding the best solution will be improved. Ant colony optimization algorithm, not only promote the ability of this proposed algorithm, but also decreases the total working time because of decreasing in setup times and modifying the working production line. Thus, the similar work has the same production lines. Other advantage of this algorithm is that the similar machines (not the same) can be considered. So, these machines are able to process a job with different processing and setup times. According to this capability and from this algorithm evaluation point of view, a number of test problems are solved and the associated results are analyzed. The results show a significant decrease in throughput time. It also shows that, this algorithm is able to recognize the bottleneck machine and to schedule jobs in an efficient way.
},
	    journal   = {International Journal of Mechanical and Mechatronics Engineering},
	  volume    = {1},
	  number    = {2},
	  year      = {2007},
	  pages     = {123 - 128},
	  ee        = {https://publications.waset.org/pdf/11398},
	  url   	= {https://publications.waset.org/vol/2},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 2, 2007},
	}