Premium
Minimizing Total Tardiness: A Case Study in an Autoparts Factory
Author(s) -
Kiyuzato Leandro,
Ronconi Debora P.,
Salamoni Rodribo,
Tsai Chana K.,
Yoshizaki Hugo
Publication year - 2002
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/1475-3995.00361
Subject(s) - tardiness , scheduling (production processes) , mathematical optimization , computer science , due date , minification , job shop scheduling , schedule , heuristic , factory (object oriented programming) , single machine scheduling , operations research , mathematics , programming language , operating system
The application of heuristic procedures for solving a real scheduling problem that arises in an autoparts factory is reported in this paper. Due to the characteristics of the environment, the measure of performance considered is the minimization of the total tardiness of the jobs. The original problem is reduced to the single machine scheduling problem, and the dispatching rules EDD (earliest due date), SPT (shortest processing time), and the PSK algorithm are used to obtain approximate solutions. Computational tests and a comparison with the usual schedule are presented.