Abstract
The problem of scheduling in flowshop and flowline-based manufacturing cell (or simply, a cell) is considered with the objective of minimizing mean tardiness of jobs. A heuristic algorithm, based on the simulated annealing (SA) technique, is developed. We propose a method for obtaining a seed sequence. We then present two perturbation schemes, the Random Insertion Perturbation Scheme and the Curtailed Random Insertion Perturbation Scheme. The proposed SA algorithm with two schemes is evaluated against the existing heuristics that seek to minimize mean tardiness of jobs. The results of the computational evaluation reveal that the proposed SA algorithm with two schemes performs better than the existing heuristics. A similar performance is also observed in the cell scheduling problem. We have also evaluated the effectiveness of the SA algorithm in minimizing the weighted mean tardiness of jobs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
