Identical machine scheduling to minimize the number of tardy jobs when lot-splitting is allowed

被引：13

作者：

Suer, GA

Pico, F

Santiago, A

机构：

来源：

COMPUTERS & INDUSTRIAL ENGINEERING | 1997年 / 33卷 / 1-2期

关键词：

identical machine scheduling; minimizing number of tardy jobs; lot-splitting;

D O I：

10.1016/S0360-8352(97)00092-2

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In this paper, minimizing the number of tardy jobs in identical parallel machine scheduling is discussed. Four mathematical modeling formulations are presented to consider setup times and lot-splitting decisions. The results of the experimentation are presented and concluding remarks are made. (C) 1997 Elsevier Science Ltd.

引用

页码：277 / 280

页数：4

共 6 条

[1] [Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[2] Bedworth D.D., 1987, Integrated Production Control Systems, Management, Analysis
[3] MINIMIZING THE NUMBER OF TARDY JOBS FOR M-PARALLEL MACHINES
HO, JC
CHANG, YL
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 84 (02) : 343 - 355
[4] PREEMPTIVE SCHEDULING OF 2 UNIFORM MACHINES TO MINIMIZE THE NUMBER OF LATE JOBS
LAWLER, EL
MARTEL, CU
[J]. OPERATIONS RESEARCH, 1989, 37 (02) : 314 - 318
[5] N JOB, ONE MACHINE SEQUENCING ALGORITHM FOR MINIMIZING THE NUMBER OF LATE JOBS
MOORE, JM
[J]. MANAGEMENT SCIENCE, 1968, 15 (01) : 102 - 109
[6] SUER GA, 1993, P 15 C COMP IND ENG

← 1 →