ON SEQUENCING OF N JOBS ON ONE MACHINE TO MINIMIZE NUMBER OF JOBS LATE

被引：0

作者：

ELMAGHRA.SE ^{[1
]}

机构：

[1] N CAROLINA STATE UNIV,RALEIGH,NC 27607

来源：

MANAGEMENT SCIENCE SERIES A-THEORY | 1972年 / 18卷 / 07期

关键词：

D O I：

10.1287/mnsc.18.7.389

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：389 / &

共 50 条

[1] SEQUENCING NORMAL-JOBS ON ONE MACHINE TO MINIMIZE NUMBER OF LATE JOBS
MAXWELL, WL
MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 16 (05): : 295 - 297
[2] N JOB, ONE MACHINE SEQUENCING ALGORITHM FOR MINIMIZING THE NUMBER OF LATE JOBS
MOORE, JM
MANAGEMENT SCIENCE, 1968, 15 (01) : 102 - 109
[3] Scheduling n jobs on one machine to minimize the maximum lateness with a minimum number of tardy jobs
Chang, PC
Su, LH
COMPUTERS & INDUSTRIAL ENGINEERING, 2001, 40 (04) : 349 - 360
[4] Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs
Vakhania, Nodari
OPERATIONS RESEARCH LETTERS, 2009, 37 (06) : 405 - 410
[5] SCHEDULING N JOBS ON ONE MACHINE TO MINIMIZE THE MAXIMUM TARDINESS WITH MINIMUM NUMBER TARDY
SHANTHIKUMAR, JG
COMPUTERS & OPERATIONS RESEARCH, 1983, 10 (03) : 255 - 266
[6] SEQUENCING TO MINIMIZE WEIGHTED NUMBER OF TARDY JOBS
LAWLER, EL
REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1976, 10 (05): : 27 - 33
[7] Single machine batch scheduling to minimize the weighted number of late jobs
Brucker, Peter
Kovalyov, Mikhail Y.
ZOR. Zeitschrift fur Operations-Research, 1996, 43 (01): : 1 - 8
[8] Genetic algorithms to minimize the weighted number of late jobs on a single machine
Sevaux, M
Dauzère-Pérès, S
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 151 (02) : 296 - 306
[9] Single machine scheduling to minimize the number of late jobs under uncertainty
Sung, SC
Vlach, M
FUZZY SETS AND SYSTEMS, 2003, 139 (02) : 421 - 430
[10] Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs
Lee, Wen-Chiung
Lu, Zon-Syun
APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (17) : 8750 - 8757

← 1 2 3 4 5 →