Journal
SCIENTIFIC WORLD JOURNAL
Volume -, Issue -, Pages -Publisher
HINDAWI LTD
DOI: 10.1155/2014/620150
Keywords
-
Categories
Funding
- Ministry of Science and Technology of Taiwan [MOST 103-2221-E-252-004]
Ask authors/readers for more resources
This paper considers single machine scheduling and due date assignment with setup time. The setup time is proportional to the length of the already processed jobs; that is, the setup time is past-sequence-dependent (p-s-d). It is assumed that a job's processing time depends on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs, and the cost of due date assignment. We analyze these problems with two different due date assignment methods. We first consider the model with job-dependent position effects. For each case, by converting the problem to a series of assignment problems, we proved that the problems can be solved in O(n(4)) time. For the model with job-independent position effects, we proved that the problems can be solved in O(n(3)) time by providing a dynamic programming algorithm.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available