SINGLE-MACHINE SEQUENCING WITH CONTROLLABLE PROCESSING TIMES

被引：80

作者：

PANWALKAR, SS ^{[1
]}

RAJAGOPALAN, R ^{[1
]}

机构：

[1] MERCER UNIV,DEPT IND SYST ENGN,MACON,GA 31027

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1992年 / 59卷 / 02期

关键词：

SCHEDULING; DUE DATE ASSIGNMENT;

D O I：

10.1016/0377-2217(92)90144-X

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider a static single-machine sequencing problem in which job processing times are controllable variables with linear costs. All jobs have a common due data. The objective is to find optimal processing times, an optimal due date and an optimal sequence which will minimize a cost function containing earliness cost, tardiness costs, and total processing cost.

引用

页码：298 / 302

页数：5

共 9 条

[1]

Baker K., 1974, INTRO SEQUENCING SCH

[2] A NOTE ON A PARTIAL SEARCH ALGORITHM FOR THE SINGLE-MACHINE OPTIMAL COMMON DUE-DATE ASSIGNMENT AND SEQUENCING PROBLEM [J].