Minimize the Makespan in Flow Shop Scheduling Problems Using African Wild Dog Algorithm

Abstract

 This paper considers ‘n’ jobs ‘m’ machines flow shop scheduling problems. Most real world scheduling problems are NP-hard in nature. The objective of this paper is to find minimum makespan in a serial multiple machines manufacturing system and all the jobs are flow in one pass manner. Generally, processing of ‘n’ jobs by ‘m’ machines is solved by Gantt chart method, which gives an active feasible schedule

Authors and Affiliations

S. Sridhar*

Keywords

Related Articles

 TENSILE STRENGTH OF WELDED MILD STEEL SPECIMEN ON UNIVERSAL TESTING MACHINE

 The aim of my paper is to find the various properties of mild steel specimen which is welded by mainly three welding . Quality and productivity play important role in today’s manufacturing market. Now a day’s due...

 The Midrex Process and the Nigerian Steel Industry

 The goal of producing steel in Nigeria from iron ore was made possible through the Midrex Process based Direct Reduction plant at the Delta Steel Company. The iron ore was originally imported from Liberia and its...

 Design and Control of Internet of Things Enabled Wireless Sensor Network

 In this paper, we have reported an effective implementation of Internet of Things used for monitoring and control of regular domestic conditions by means of low cost sensor network. The interconnecting mechanisms...

 REDUCING POWER DISSIPATION IN SELF STARTING AND SELF CORRECTING COUNTER USING A LOOK-AHEAD CLOCK GATING

 In this paper, a novel Self-starting and Self-correcting counter implemented with some techniques are presented to reduce the power consumption in sequential circuits. Clock gating is a predominant technique used...

 Improved Software Development Effort Estimation Based on Fuzzy Logic Functions

 The systems and software development industry is characterized by a paradigm of project failure. One of the known contributing causes of these project failures is poor requirements engineering and management, whic...

Download PDF file
  • EP ID EP122334
  • DOI -
  • Views 65
  • Downloads 0

How To Cite

S. Sridhar* (30).  Minimize the Makespan in Flow Shop Scheduling Problems Using African Wild Dog Algorithm. International Journal of Engineering Sciences & Research Technology, 3(9), 306-309. https://europub.co.uk/articles/-A-122334