Minimizing maximum tardiness in a multi-machine earliest due date problem in flow shop & job shop environment using a proposed heuristic model.

In this study a scheduling problem is considered. The objective is to minimize the maximum tardiness and in similar cases tardiness to minimize the total summation of tardiness penalties. In order to achieve such an objective a single machine scheduling problem algorithm is considered and its algorithm is extended to multi-machine scheduling. Two kinds of problems are considered as flow shop and job shop. In the flow shop problem jobs should be processed on m machines respectively. In the job shop jobs should be rocessed on some of the m machines in different orders. At the end of the study numerical example is exhibited.

کلیدواژه ها:

scheduling problem ، multi-machine scheduling ، flow shop ، job shop