INPUT CONTROL IN JOB SHOPS

被引:5
作者
RAMAN, N
机构
[1] Department of Business Administration, University of Illinois at Urbana-Champaign, Champaign, IL
关键词
D O I
10.1080/07408179508936732
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Input control plays a critical role in regulating the release of jobs into a production system, and thereby controlling the inventory levels. We model the input control decision as a bicriteria problem that requires the maximization of the sum of job release times subject to minimum total job tardiness. Although the primary objective addresses job completion delays, the secondary objective considers earliness and waiting times. We propose a solution method that decomposes the original problem into a bicriteria problem for the critical jobs and the maximum release time problem for the noncritical jobs. These problems are solved in an iterative manner as the set of critical jobs is repetitively updated until no further improvement takes place. Computational results show the effectiveness of the proposed method as well as the substantial improvement that can be affected in job release times, without adversely affecting the tardiness values, over an approach that considers the single objective of minimizing total tardiness. This result is of interest to an operating manager who is responsible for controlling work-in-process and finished goods inventory related costs in addition to meeting due dates effectively.
引用
收藏
页码:201 / 209
页数:9
相关论文
共 22 条
[1]   MINIMIZING JOB IDLENESS IN DEADLINE CONSTRAINED ENVIRONMENTS [J].
AHMADI, RH ;
BAGCHI, U .
OPERATIONS RESEARCH, 1992, 40 (05) :972-985
[2]  
Baker K., 1974, INTRO SEQUENCING SCH
[3]  
Baker K.R., 1984, J OPER MANAGE, V4, P99, DOI [10.1016/0272-6963(84)90026-3, DOI 10.1016/0272-6963(84)90026-3]
[4]   SEQUENCING RULES AND DUE-DATE ASSIGNMENTS IN A JOB SHOP [J].
BAKER, KR .
MANAGEMENT SCIENCE, 1984, 30 (09) :1093-1104
[5]   SEQUENCING WITH EARLINESS AND TARDINESS PENALTIES - A REVIEW [J].
BAKER, KR ;
SCUDDER, GD .
OPERATIONS RESEARCH, 1990, 38 (01) :22-36
[6]   THE ONE-MACHINE SEQUENCING PROBLEM [J].
CARLIER, J .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1982, 11 (01) :42-47
[7]   A NOTE ON THE SINGLE-MACHINE SCHEDULING PROBLEM WITH MINIMUM WEIGHTED COMPLETION-TIME AND MAXIMUM ALLOWABLE TARDINESS [J].
CHAND, S ;
SCHNEEBERGER, H .
NAVAL RESEARCH LOGISTICS, 1986, 33 (03) :551-557
[8]  
CHAND S, 1985, 424 U MICH GRAD SCH
[9]  
DU Z, 1990, MATH OPER RES, V15, P483
[10]   MINIMIZING WEIGHTED ABSOLUTE DEVIATION IN SINGLE-MACHINE SCHEDULING [J].
FRY, TD ;
ARMSTRONG, RD ;
BLACKSTONE, JH .
IIE TRANSACTIONS, 1987, 19 (04) :445-450