OPTIMAL CONSTANT DUE-DATE DETERMINATION AND SEQUENCING OF N-JOBS ON A SINGLE-MACHINE

被引:10
作者
CHENG, TCE
机构
[1] Department of Actuarial and Management Sciences, University of Manitoba, Winnipeg
关键词
D O I
10.1016/0925-5273(91)90101-X
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper considers due-date determination and sequencing of n jobs on a single-machine where each job is given a constant flow allowance. The objective is to determine the optimal value of the flow allowance and the optimal job sequence to minimize a cost function based on the flow allowance and the job earliness and tardiness values. We first propose a linear programming (LP) formulation of the problem and then derive the optimal constant flow allowance via considering the LP dual problem. We show that the optimal constant due-date value is independent of job sequence. After the theoretical treatment, a numerical example is presented for discussion.
引用
收藏
页码:259 / 261
页数:3
相关论文
共 9 条
[1]  
Conway, Priority dispatching and job lateness in a job shop, J. Ind. Eng., 16, pp. 228-237, (1965)
[2]  
Eilon, Chowdhury, Due-dates in job shop scheduling, Int. J. Prod. Res., 14, pp. 223-237, (1976)
[3]  
Weeks, Fryer, A methodology for assigning minimum cost due-dates, Manage. Sci., 23, pp. 872-881, (1977)
[4]  
Cheng, Optimal due-date determination and sequencing of n jobs on a single machine, J. Oper. Res. Soc., 35, pp. 433-437, (1984)
[5]  
Cheng, Optimal due-date assignment in a job shop, Int. J. Prod. Res., 24, pp. 503-515, (1986)
[6]  
Kanet, Minimizing the average deviation of job completion times about a common due-dates, Naval Res. Logistics Q., 28, pp. 643-651, (1981)
[7]  
Panwalker, Smith, Seidmann, Common due-date assignment to minimize total penalty for the one machine sequencing problem, Operations Research, 30, pp. 391-399, (1982)
[8]  
Seidmann, Panwalker, Smith, Optimal assignment of due-dates for a single processor scheduling problem, Int. J. Prod. Res., 19, pp. 393-399, (1981)
[9]  
Seidmann, Smith, Due-date assignment for production systems, Manage. Sci., 27, pp. 571-581, (1981)