Production scheduling for a job shop using a mathematical model

Abstract

Today, all organizations are continually seeking to produce high quality, reliable, and timely goods and services that meet the needs of their customers. Therefore, production scheduling is one of the most complex activities in production management in organizations. In the present work, the production projection is developed in a Job Shop system using a mathematical model of linear integer programming whose objective is to minimize the total lateness. The developed model is validated by means of an application case with three jobs and four machines, obtaining the optimum programming according to the requirements. The results obtained have been compared with a scheduling software to evaluate the performance of the proposed model.

Reducing noise pollution by flexible job-shop scheduling with worker flexibility: Multi-subpopulation evolutionary algorithm

“…They also solved the problem in small size using the branch and bound method. Mendoza et al [33] proposed a linear programming model to minimize the tardiness in the jobshop problem and solved it in numerical examples to investigate the efficiency of the proposed model. Sadaghiani et al [34] developed a multi-objective mixed-integer programming model for the flexible job-shop problem that minimized the makespan, total workload, and maximum workload of machines.…”