Abstract
This paper exhibits an adaptation of Campbell Dudek Smith (CDS) algorithm for a flow shop system whose end product consists of four components, each of which is firstly processed in a single-stage with parallel machines, followed by a number of batch processors, and then finally assembled in one of available assembling stations. The first step of the procedure is to compute equivalent processing times of each stage for each job, and then use the equivalent processing times to find the job sequence using the CDS algorithm. After the job sequence found, the final step is to schedule the jobs considering the parallel machines, the batch processors, and the assembling stations. Numerical example shows that this procedure results a reasonably good schedule for the case studied.
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.
