Abstract
Abstract The problem of scheduling in a cellular manufacturing system is considered with the objective of minimizing the sum of completion times (or total flow time) of jobs. A correct formulation of recursive equation for the flowline-based cellular manufacturing system is first proposed. Subsequently a heuristic is developed to obtain a sequence that minimizes total flow time in a flowline cell. The proposed heuristic makes use of the simulated annealing technique and is developed in two stages. A good initial heuristic seed sequence obtained in the first stage is improved upon by a proposed new variant of the simulated annealing technique wherein three different perturbation schemes have been experimented with. One of the perturbation schemes is newly proposed in this paper and is called the Adjacent interchange scheme. The proposed simulated annealing algorithm has been compared with the existing heuristics for minimizing flow time and has shown consistently good and superior solutions.
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.
