Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan

被引：0

作者：

L. L. Liu

C. T. Ng

T. C. E. Cheng

机构：

[1] Shanghai Second Polytechnic University,School of Science

[2] The Hong Kong Polytechnic University Hung Hom,Department of Logistics and Maritime Studies

来源：

Optimization Letters | 2014年 / 8卷

关键词：

Scheduling; Release dates; Batch processing; Makespan ;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Batch processing happens in many different industries, in which a number of jobs are processed simultaneously as a batch. In this paper we develop two heuristics for the problem of scheduling jobs with release dates on parallel batch processing machines to minimize the makespan and analyze their worst-case performance ratios. We also present a polynomial-time optimal algorithm for a special case of the problem where the jobs have equal processing times.

引用

页码：307 / 318

页数：11

共 50 条

[1] Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
Liu, L. L.
Ng, C. T.
Cheng, T. C. E.
[J]. OPTIMIZATION LETTERS, 2014, 8 (01) : 307 - 318
[2] Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
Li, Shisheng
Ng, C. T.
Cheng, T. C. E.
Yuan, Jinjiang
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 210 (03) : 482 - 488
[3] Scheduling jobs with release dates on parallel batch processing machines
Liu, L. L.
Ng, C. T.
Cheng, T. C. E.
[J]. DISCRETE APPLIED MATHEMATICS, 2009, 157 (08) : 1825 - 1830
[4] Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
Lancia, G
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 120 (02) : 277 - 288
[5] SCHEDULING JOBS WITH RELEASE DATES AND TAILS ON IDENTICAL MACHINES TO MINIMIZE THE MAKESPAN
CARLIER, J
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1987, 29 (03) : 298 - 306
[6] The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
Yuan, JJ
Liu, ZH
Ng, CT
Cheng, TCE
[J]. THEORETICAL COMPUTER SCIENCE, 2004, 320 (2-3) : 199 - 212
[7] The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
Lu, Lingfa
Zhang, Liqi
Yuan, Jinjiang
[J]. THEORETICAL COMPUTER SCIENCE, 2008, 396 (1-3) : 283 - 289
[8] SCHEDULING JOBS WITH STOCHASTIC PROCESSING REQUIREMENTS ON PARALLEL MACHINES TO MINIMIZE MAKESPAN OR FLOWTIME
WEBER, RR
[J]. JOURNAL OF APPLIED PROBABILITY, 1982, 19 (01) : 167 - 182
[9] A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
Gao, Yuan
Yuan, Jinjiang
Ng, C. T.
Cheng, T. C. E.
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 273 (01) : 74 - 81
[10] Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
Shisheng Li
Jinjiang Yuan
[J]. Journal of Combinatorial Optimization, 2010, 19 : 84 - 93

← 1 2 3 4 5 →