Journal
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
Volume 53, Issue 2, Pages 479-495Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAC.2007.915166
Keywords
controllable processing times; dynamic programming; manufacturing systems; optimal control; scheduling algorithms
Ask authors/readers for more resources
A particular scheduling problem over a single machine is considered. Jobs belong to different classes, and two jobs belonging to the same class are considered as completely equivalent. A sequence of due dates is specified for each class of jobs, and the serviced jobs, for each class, are assigned to the due dates according to the EDD rule. The service time of any job of a given class has to be selected within an interval of possible values (the highest possible one being the nominal service time). A deviation of the actual service time from the nominal value determines a cost that has a linear dependence on such a deviation. The cost function to be minimized is the sum of the total (weighted) tardiness cost and the overall service time deviation cost. The decision variables are those concerning job sequencing (taking into account the equivalence of jobs of the same class) and service times. In this paper, a solution to this problem is provided in terms of closed-loop strategies.
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