Abstract
This study considers a two-machine flowshop scheduling problem for the objective of minimizing total tardiness. In the flowshop, jobs have to be started on the second machine within the limited waiting time after those jobs are completed on the first machine, which is called a limited waiting time constraint, and jobs require sequence-dependent setup times before processing on the second machine. This scheduling problem is modeled in a mathematical programming formulation and the optimal solutions are obtained by CPLEX 12.9. However, solving this problem to optimality by using CPLEX needs a significantly long computation time since this problem is known to be NP-complete, hence heuristic algorithms are proposed to solve the problem within a short computation time. Computational experiments on randomly generated problem instances are done to evaluate the performance of the proposed 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
