Premium
TECHNICAL NOTE: A SIMPLE MODEL FOR OPTIMIZING THE SINGLE MACHINE EARLY/TARDY PROBLEM WITH SEQUENCE‐DEPENDENT SETUPS
Author(s) -
COLEMAN B. JAY
Publication year - 1992
Publication title -
production and operations management
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.279
H-Index - 110
eISSN - 1937-5956
pISSN - 1059-1478
DOI - 10.1111/j.1937-5956.1992.tb00354.x
Subject(s) - tardiness , computer science , mathematical optimization , simple (philosophy) , scheduling (production processes) , sequence (biology) , single machine scheduling , integer programming , variable (mathematics) , due date , job shop scheduling , scale (ratio) , operations research , algorithm , mathematics , schedule , mathematical analysis , philosophy , physics , epistemology , quantum mechanics , biology , genetics , operating system
A simple mixed integer programming model for the N job/single machine scheduling problem with possibly sequence‐dependent setup times, differing earliness/tardiness cost penalties, and variable due dates is proposed and evaluated for computational efficiency. Results indicated that the computational effort required to reach optimality rose with the number of jobs to be scheduled and with decreased variance in due dates. Though computational effort was significant for the largest problems solved, the model remained viable for optimizing research scale problems.