Minimize the Makespan in Flow Shop Scheduling Problems Using African Wild Dog Algorithm
Journal Title: International Journal of Engineering Sciences & Research Technology - Year 30, Vol 3, Issue 9
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*
Tire Inflation Rate Modeling
This paper will examine in detail the conditions of correctly inflated tire pressure that gives appropriate support from the contained air pressure to provide an even distribution of load across the footprint and...
DESIGN OF STEPPED IMPEDANCE LOW PASS FILTER AT 2.4GHz
In this era, life can't be envisioned without wireless communication. The microwave filter is a component which gives frequency selectivity in mobile, radar, satellite communication systems working at microwav...
Performance Analysis of IEEE 802.15.4/ZigBee Wireless Sensor Networks
Wireless sensor networks are becoming very popular from daily life to environmental monitoring, agriculture, health care, home automation and many more. The survey on these types of networks showed that, the depl...
Digital Image Processing: An Overview of Computational Time Requirement
Image processing is a growing field covering a wide range of techniques for the manipulation of digital images [1].Many image processing tasks can be characterized as being computationally intensive. One reason for thi...
SOLAR POWERED BATTERY OPERATED ELECTRIC VEHICLE AS AN OPTION FOR FUEL VEHICLE
India’s road are becoming moreconngested each year with cars and buses. Research has shown that motorization is increasing even more rapidly than urbanization and increased traffic worsens India’s pollution proble...