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

Programming Language and Artificial Intelligence Development

The term language means communication tool which is used to write Computer program and develop application, scripts, or other set of instructions for a computer to execute. Computer programming languages are used to wr...

 Outsourced Data By Using Hamming Joins

  certain properties) in an outsourced relational database framework with computational privacy and low overhead – a first, to the best of our knowledge. In an outsourced database framework, clients place data man...

 CROSS-SECTION MEASUREMENT FOR 40CA BY APPLYING AGS EQUATION IN STRIPPING REACTION

 By applying AGS equation the cross section values for 40Ca are plotted .Here 15 point Gaussian quadrature methods are applied to convert the multidimensional equation into one dimensional form.The singularities are...

 Efficient Technique for Improving the Frequency Response of CIC Compensation

 This paper presents a new method to improve the frequency response of CIC compensation filter. After the CIC filter cascaded the fir filter which has inversed magnitude response to CIC compensation filter was prop...

 Evaluating the Short Comings of Clustering based Segmentation Techniques

 This paper has presented a evaluation of some well-known image segmentation techniques. The segmentation process; divides a given image into distinct regions and objects. It has become more popular due to its var...

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