A SURVEY OF SINGLE MACHINE SCHEDULING TO MINIMIZE WEIGHTED NUMBER OF TARDY JOBS

被引：38

作者：

Adamu, Muminu O. ^{[1
]}

Adewumi, Aderemi O. ^{[2
]}

机构：

[1] Univ Lagos, Dept Math, Lagos, Nigeria

[2] Univ Kwazulu Natal, Sch Math Stat & Comp Sci, ZA-4000 Durban, South Africa

来源：

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION | 2014年 / 10卷 / 01期

关键词：

Single machine; Just-In-Time; Scheduling; batching; precedence constraint; CONTROLLABLE PROCESSING TIMES; MULTIPLE PERFORMANCE-MEASURES; SETUP TIMES; RESOURCE-ALLOCATION; TARDINESS SUBJECT; MAXIMUM EARLINESS; RELEASE DATES; SEQUENCING ALGORITHM; GENETIC ALGORITHMS; OPTIMALITY PROOF;

D O I：

10.3934/jimo.2014.10.219

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This paper presents a review of single machine scheduling to minimize the weighted number of tardy jobs. The problem involves processing n jobs on a single machine, each having processing time p(j) and due date d(j). The aim is to schedule the jobs to meet their due date. A job is tardy if the completion time of job j is C-j > d(j) and on-time otherwise. This paper assesses works done to minimize the weighted number of tardy jobs by providing an extensive review of authors, methods and techniques used. Finally, the possible direction for future research is presented.

引用

页码：219 / 241

页数：23

共 50 条

[31] Pareto-scheduling with double-weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
Guo, Shuen
Lu, Lingfa
Yuan, Jinjiang
Ng, Chi To
Cheng, Tai Chiu Edwin
NAVAL RESEARCH LOGISTICS, 2022, 69 (05) : 816 - 837
[32] Data-driven Single Machine Scheduling Minimizing Weighted Number of Tardy Jobs
Antonov, Nikolai
Sucha, Premysl
Janota, Mikolas
PROGRESS IN ARTIFICIAL INTELLIGENCE, EPIA 2023, PT I, 2023, 14115 : 483 - 494
[33] Scheduling linear deteriorating jobs to minimize the number of tardy jobs
Abbasali Jafari
Ghasem Moslehi
Journal of Global Optimization, 2012, 54 : 389 - 404
[34] Minimizing the weighted number of tardy jobs on a single machine with release dates
M'Hallah, Rym
Bulfin, R. L.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (02) : 727 - 744
[35] Minimizing Weighted Number of Tardy Jobs on Unbounded Single Batching Machine with Family Jobs
Zheng, Rui
Li, Hongyu
2009 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-4, 2009, : 1718 - 1722
[36] Serial batching to minimize the weighted number of tardy jobs
Hermelin, Danny
Mnich, Matthias
Omlor, Simon
JOURNAL OF SCHEDULING, 2024, 27 (06) : 545 - 556
[37] Minimizing the weighted number of tardy jobs on a general single machine
Chou, FD
Su, LH
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2004, 11 (02): : 187 - 196
[38] Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
Azizoglu, M
Köksalan, M
Kondak, S
RESEARCH AND PRACTICE IN MULTIPLE CRITERIA DECISION MAKING, 2000, 487 : 381 - 387
[39] Single machine stochastic scheduling to minimize the expected number of tardy jobs using mathematical programming models
Seo, DK
Klein, CA
Jang, W
COMPUTERS & INDUSTRIAL ENGINEERING, 2005, 48 (02) : 153 - 161
[40] Note on scheduling with general learning curves to minimize the number of tardy jobs
Mosheiov, G
Sidney, JB
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2005, 56 (01) : 110 - 112

← 1 2 3 4 5 →