Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine

被引：16

作者：

Liu, ZH

Cheng, TCE ^{[1
]}

机构：

[1] Hong Kong Polytech Univ, Dept Logist, Kowloon, Hong Kong, Peoples R China

[2] E China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China

来源：

THEORETICAL COMPUTER SCIENCE | 2005年 / 347卷 / 1-2期

基金：

中国国家自然科学基金;

关键词：

scheduling; batch processing; approximation scheme;

D O I：

10.1016/j.tcs.2005.07.028

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A batch machine is a machine that can process a number of jobs simultaneously as a batch, and the processing time of a batch is equal to the longest processing time of the jobs assigned to it. In this paper, we present a polynomial time approximation scheme (PTAS) for scheduling a batch machine to minimize the total completion time with job release dates. Also, we present a fully polynomial time approximation scheme (FPTAS) for scheduling an unbounded batch machine, which can process an arbitrary number of jobs simultaneously, to minimize the total weighted completion time with job release dates. (c) 2005 Elsevier B.V. All rights reserved.

引用

页码：288 / 298

页数：11

共 50 条

[1] Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
Eren, Tamer
APPLIED MATHEMATICS AND COMPUTATION, 2009, 208 (02) : 355 - 358
[2] On minimizing total completion time in batch machine scheduling
Poon, CK
Cu, WC
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2004, 15 (04) : 593 - 607
[3] Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
Kramer, Arthur
Dell'Amico, Mauro
Feillet, Dominique
Iori, Manuel
COMPUTERS & OPERATIONS RESEARCH, 2020, 123 (123)
[4] Single machine batch processing problem with release dates to minimize total completion time
Beldar, Pedram
Costa, Antonio
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2018, 9 (03) : 331 - 348
[5] On minimizing average weighted completion time of multiprocessor tasks with release dates
Fishkin, AV
Jansen, K
Porkolab, L
AUTOMATA LANGUAGES AND PROGRAMMING, PROCEEDING, 2001, 2076 : 875 - 886
[6] A (2+ε)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
Sitters, Rene
Yang, Liya
OPERATIONS RESEARCH LETTERS, 2018, 46 (04) : 438 - 442
[7] A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
Skutella, Martin
OPERATIONS RESEARCH LETTERS, 2016, 44 (05) : 676 - 679
[8] Minimizing Total Weighted Completion Time on a Batch-processing Machine with Re-entrance
Zheng, Rui
Li, Hongyu
2009 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION AND LOGISTICS ( ICAL 2009), VOLS 1-3, 2009, : 1791 - 1794
[9] Minimizing total weighted completion time on parallel unbounded batch machines
School of Mathematics and Systems Science, Shandong University, Ji'nan 250100, China
不详
不详
不详
Ruan Jian Xue Bao, 2006, 10 (2063-2068):
[10] Minimizing total weighted completion time on identical parallel batch machines
Li, Shuguang
Li, Guojun
Qi, Xingqin
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2006, 17 (06) : 1441 - 1453

← 1 2 3 4 5 →