| dc.description.abstract | In fact, optimal scheduling is the most important function of the business operations of the company. It will lead to better production flexibility, shorten production cycle time significantly, reduced costs of manufacturing, increased profits and satisfied diversity demands in market. Therefore, there is a lot of research have been developed to optimize different scheduling models. In this research, we consider the job-shop scheduling with multi resources. There are three crucial resources: job, labor, and machine are combined to form the linear-mixed integer programming model. Job will be accepted to skip one or more machines dependent on the production requirement. Labor includes different skill levels and each skill levels contain specific member units. The set-up time from a machine is dependent on the array of jobs. This model is performed by using CPLEX software to figure out the optimal sequence of jobs on labors and on machines in order to minimize make-span and tardiness in a job-shop problem. To demonstrate that the proposed model can be very useful, we compare results are obtained by the proposed model with current situation of the company. | en_US |
