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

 A GREAT MATHEMATICAL TRUTH : SQUARE ROOT TWO IS AN INVISIBLE PART & PACEL OF CIRCLE (118th Geometrical construction on Real Pi)

 Square root two was introduced by Pythagorean Hippasus of Metapontum representing the diagonal of the square. In March 1998, it was discovered that the same square root two, plays an important role in deciding the...

AUTOMATIC LIGHT AND WATER CONTROL IN PUBLIC GARDEN

Today with the advent of technology things are becoming quite easy and user-friendly. The pace of Progress in development of technology had led to invention of many revolutionary products. This revolution in technology...

 Routing & Energy Conservation Protocols in WSN- A Review

 The most important task of a sensor base station. One simple approach to the complete this task is direct data transmission. In this case, each node in the network directly sends sensing data to the base station....

A Survey on Wireless Broadcast Services

In a mobile wireless communication network, broadcast signaling can be transmitted to multiple (two or more) receivers simultaneously. In networking, a distinction is made between broadcasting and multicasting. Broadca...

 ADAPTIVE BEAMFORMING AND CANCELLATION OF JAMMER USING LINEAR ARRAY ANTENNA SYSTEM

 The radiation pattern of an antenna depends on the type, size and parameters of feed current. To change the direction of maximum and minimum gain the mechanical steering is necessary. Electronic steering is only p...

Download PDF file
  • EP ID EP122334
  • DOI -
  • Views 74
  • 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