Operations Research, Systems Engineering and Industrial Engineering Commons^™

Exact And Heuristic Algorithms For The Job Shop Scheduling Problem With Earliness And Tardiness Over A Common Due Date, Leonardo Bedoya-Valencia

Engineering Management & Systems Engineering Theses & Dissertations

Scheduling has turned out to be a fundamental activity for both production and service organizations. As competitive markets emerge, Just-In-Time (JIT) production has obtained more importance as a way of rapidly responding to continuously changing market forces. Due to their realistic assumptions, job shop production environments have gained much research effort among scheduling researchers. This research develops exact and heuristic methods and algorithms to solve the job shop scheduling problem when the objective is to minimize both earliness and tardiness costs over a common due date. The objective function of minimizing earliness and tardiness costs captures the essence of the …