Abstract
This research investigates a no-wait two-stage assembly-type flowshop for the objective of minimizing total completion times. The first stage consists of m machines on which mtypes of components are fabricated, while the second stage has a single-machine on which thosecomponents are assembled. In the problem, the assembly operations in the second stage should be started immediately after those fabrications are completed in the first stage. This problem is modeled in a mathematical programming formulation and the optimal solutions are obtained by CPLEX. Since this problem is known to be NP-complete, heuristic algorithms are proposed to solve the large sized problem within a short computation time. Computational experiments on randomly generated problem instances are done to evaluate the performance of the algorithms and the results are reported.
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 call
