A branch and bound to minimize the number of late jobs on a single machine with release time constraints

被引：36

作者：

Baptiste, Philippe ^{[1
]}

Peridy, Laurent ^{[2
]}

Pinson, Eric ^{[2
]}

机构：

[1] CNRS, UMR 6599 HeuDiaSyC, Université de Technologie de Compiègne, F-60200 Compiègne, France

[2] Institut de Mathematiques Appliquees, Universite Catholique de l'Ouest, 44, rue Rabelais, F-49008 Angers Cedex 01, France

来源：

European Journal of Operational Research | 2003年 / 144卷 / 01期

关键词：

D O I：

10.1016/S0377-2217(01)00353-8

中图分类号：

学科分类号：

摘要：

Operations research

引用

页码：1 / 11

共 50 条

[21] Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
Crauwels, HAJ
Potts, CN
VanWassenhove, LN
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 90 (02) : 200 - 213
[22] Single machine scheduling to minimize the number of early and tardy jobs
Lann, A
Mosheiov, G
COMPUTERS & OPERATIONS RESEARCH, 1996, 23 (08) : 769 - 781
[23] Single-machine scheduling to minimize the number of early jobs
Huang, R. H.
Yang, C. L.
2007 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-4, 2007, : 955 - +
[24] A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
Rasti-Barzoki, Morteza
Hejazi, Seyed Reza
Mazdeh, Mohammad Mahdavi
APPLIED MATHEMATICAL MODELLING, 2013, 37 (07) : 4924 - 4937
[25] Preemptive scheduling of jobs with tied parameters on a single processor to minimize the number of late jobs
Vakhania, Nodari
PROCEEDINGS OF THE AMERICAN CONFERENCE ON APPLIED MATHEMATICS: RECENT ADVANCES IN APPLIED MATHEMATICS, 2009, : 101 - +
[26] An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
Baptiste, P
OPERATIONS RESEARCH LETTERS, 1999, 24 (04) : 175 - 180
[27] Single‐machine scheduling to minimize maximumtardiness with minimum number of tardy jobs
J.N.D. Gupta
A.M.A. Hariri
C.N. Potts
Annals of Operations Research, 1999, 92 : 107 - 123
[28] An exact method to minimize the number of tardy jobs in single machine scheduling
Dauzère-Pérès, S
Sevaux, M
JOURNAL OF SCHEDULING, 2004, 7 (06) : 405 - 420
[29] A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
He, Cheng
Lin, Yixun
Yuan, Jinjiang
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 201 (03) : 966 - 970
[30] A SURVEY OF SINGLE MACHINE SCHEDULING TO MINIMIZE WEIGHTED NUMBER OF TARDY JOBS
Adamu, Muminu O.
Adewumi, Aderemi O.
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2014, 10 (01) : 219 - 241

← 1 2 3 4 5 →