This paper reviews static scheduling research on single machine for the last three decades. One hundred seventy one papers were found on this topic after an extensive search in the English language periodicals. These papers are classified on the basis of the objective functions and constraints. Contribution of each paper is analyzed in terms of its theoretical and computational results. An analysis of the literature on the basis of number of articles published in each year, in each category, in different journals and by different authors has also been provided. This reveals several interesting facts about the developments in single machine scheduling (SMS) research and its future.
