| dc.description.abstract | Based on the necessity of reducing number of lateness orders of DongJin Vina Textile company whose factory is confronted with number of orders are not delivered on time, this thesis would like to focus on the scheduling of production in dyeing factory. In this paper, Multi-machine assignment scheduling problem (MASP)was assigned with objective is to give an optimal dyeing sequence which minimize the total number of tardiness .In addition to objective many constraints were consider to apply. The solving problem was formulated as a Mix Integer Programming (MIP) which is evaluated by a real situation of company. Moreover, this thesis was included Heuristic algorithm for planning with the big input data. Both MIP model and Heuristic algorithm provide the better method for optimal scheduling which suit with company’s situation.
Keywords: Multi-machine assignment scheduling problem (MASP), dyeing sequence scheduling, Mix integer program (MIP), Heuristic algorithm, | en_US |
