Advertisement
Published in:
2012 | OriginalPaper | Chapter
Effect of Dummy Machines in the Gupta’s Heuristics for Permutation Flow Shop Problems
Authors : A. Baskar, M. Anthony Xavior
Published in: Emerging Trends in Science, Engineering and Technology
Publisher: Springer India
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
Optimizing the Make Span is one of the important performance parameters in a flow shop scheduling problem (FSP). The problem is NP hard. In a general Permutation FSP, the total number of possible sequences is (n!). The job for a shop floor supervisor is that he has to schedule the jobs such that the total processing time is minimum. In the shop floor, due to limited computing facilities and capabilities, still the classical heuristics are popular as they are simple and easy to compute manually for smaller problems. However, in many cases, we get only one sequence. This paper deals with improving the make span in an FSP using the concept of Dummy Machine in Gupta’s Heuristics. In such cases, we can get two more sequences having make spans that may be optimal/near optimal. The effect of dummy machine is analyzed using the well-known Taillard benchmark problems.