A solution approach for the single machine Early/Tardy scheduling problems

Abstract

Scheduling is one of the research topics that scholars have studied widely. As Just-In-Time production system prevails in modern manufacturing systems, the Early/Tardy (ET) objectives has received much attention in scheduling theory. The objective of this study is to develop an algorithm for solving the single machine Early/Tardy problem based on Tabu Search Method. The thesis starts by presenting a Greedy method of pair-wise jobs swapping. The parameters of the TS Method are optimized through experiments and some analytical analyses are conducted. Test problems of different sizes are used to compare the solutions resulted from the two solution methods. Different comparisons between the two approaches are discussed and final conclusions are presented.