A Linear Time Exact Algorithm for Scheduling Unit-processing-time-jobs with Sizes 1 or k

被引：0

作者：

Xin, Xiao ^{[1
]}

Mu, Guohua ^{[1
]}

Mou, Min ^{[1
]}

机构：

[1] Shandong Inst Business & Technol, Coll Foreign Studies, Yantai 264005, Peoples R China

来源：

PROCEEDINGS OF THE 2017 2ND INTERNATIONAL CONFERENCE ON MATERIALS SCIENCE, MACHINERY AND ENERGY ENGINEERING (MSMEE 2017) | 2017年 / 123卷

关键词：

Scheduling; Batch machines; Job sizes; Makespan; Linear time exact algorithm; MACHINE;

D O I：

暂无

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

The problem of scheduling jobs with sizes on batch machines is considered. Each machine can process several jobs as a batch simultaneously as long as the total size of these jobs does not exceed the capacity of the machine. The processing time of a batch is defined to be the longest processing time of the jobs in the batch. The goal is to minimize makespan, i.e., the maximum job completion time. It has been known to be strongly NP-hard. A linear time exact algorithm is presented for a special case where all the jobs have processing times 1 and sizes 1 or k (k is not fixed).

引用

页码：1760 / 1763

页数：4

共 50 条

[31] On the complexity of scheduling unit-time jobs with OR-precedence constraints
Johannes, B
OPERATIONS RESEARCH LETTERS, 2005, 33 (06) : 587 - 596
[32] Exact and heuristic algorithms for scheduling jobs with time windows on unrelated parallel machines
Giorgi Tadumadze
Simon Emde
Heiko Diefenbach
OR Spectrum, 2020, 42 : 461 - 497
[33] Exact and heuristic algorithms for scheduling jobs with time windows on unrelated parallel machines
Tadumadze, Giorgi
Emde, Simon
Diefenbach, Heiko
OR SPECTRUM, 2020, 42 (02) : 461 - 497
[34] Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs
Mitre Costa Dourado
Rosiane de Freitas Rodrigues
Jayme Luiz Szwarcfiter
Annals of Operations Research, 2009, 169 : 81 - 91
[35] Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs
Dourado, Mitre Costa
Rodrigues, Rosiane de Freitas
Szwarcfiter, Jayme Luiz
ANNALS OF OPERATIONS RESEARCH, 2009, 169 (01) : 81 - 91
[36] Scheduling controllable processing time jobs with position-dependent workloads
Oron, Daniel
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2016, 173 : 153 - 160
[37] Scheduling jobs with decreasing processing times for the total completion time minimization
Bachman, A
Janiak, A
OPERATIONS RESEARCH PROCEEDINGS 2000, 2001, : 353 - 358
[38] AN EXACT HIDDEN SPHERE ALGORITHM THAT OPERATES IN LINEAR TIME
FRANKLIN, WR
COMPUTER GRAPHICS AND IMAGE PROCESSING, 1981, 15 (04): : 364 - 379
[39] Due-window assignment with unit processing-time jobs
Mosheiov, G
Oron, D
NAVAL RESEARCH LOGISTICS, 2004, 51 (07) : 1005 - 1017
[40] Minmax earliness-tardiness costs with unit processing time jobs
Mosheiov, G
Shadmon, M
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 130 (03) : 638 - 652

← 1 2 3 4 5 →