A fast FPTAS for single machine scheduling problem of minimizing total weighted earliness and tardiness about a large common due date

被引：16

作者：

Kellerer, Hans ^{[1
]}

Rustogi, Kabir ^{[2
]}

Strusevich, Vitaly A. ^{[2
]}

机构：

[1] Karl Franzens Univ Graz, Inst Stat & Operat Res, Univ Str 15, A-8010 Graz, Austria

[2] Univ Greenwich, Sch Comp & Math Sci, Old Royal Naval Coll, Pk Row, London SE10 9LS, England

来源：

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | 2020年 / 90卷

关键词：

Single machine scheduling; Earliness-Tardiness; Half-product problem; FPTAS; APPROXIMATION SCHEMES; HALF-PRODUCTS; MINIMIZATION;

D O I：

10.1016/j.omega.2018.11.001

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

We address the single machine scheduling problem to minimize the total weighted earliness and tardiness about a nonrestrictive common due date. This is a basic problem with applications to the just-in time manufacturing. The problem is linked to a Boolean programming problem with a quadratic objective function, known as the half-product. An approach to developing a fast fully polynomial-time approximation scheme (FPTAS) for the problem is identified and implemented. The running time matches the best known running time for an FPTAS for minimizing a half-product with no additive constant. (C) 2018 Elsevier Ltd. All rights reserved.

引用

页数：5

共 50 条

[41] Minimizing Total Weighted Tardiness and Earliness on a Single Machine Production Scheduling Problem with Multi-task Maintenance Policy and Deteriorating Jobs
Haddad, Hamidreza
[J]. ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2014, 39 (08) : 6543 - 6553
[42] EARLINESS-TARDINESS SCHEDULING PROBLEMS .1. WEIGHTED DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE
HALL, NG
POSNER, ME
[J]. OPERATIONS RESEARCH, 1991, 39 (05) : 836 - 846
[43] Minimizing earliness–tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint
Lars Mönch
Robert Unbehaun
You In Choung
[J]. OR Spectrum, 2006, 28 : 177 - 198
[44] Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
Shabtay, Dvir
[J]. COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (05) : 1539 - 1545
[45] Optimal single-machine scheduling about a common due window with earliness/tardiness and additional penalties
Wu, Y
Wang, DW
[J]. INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 1999, 30 (12) : 1279 - 1284
[46] Trade-off solutions in a single-machine scheduling problem for minimizing total earliness and maximum tardiness
Wu, CC
Lee, WC
You, JM
[J]. INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2000, 31 (05) : 639 - 647
[47] Fast neighborhood search for the single machine earliness-tardiness scheduling problem
Kedad-Sidhoum, Safia
Sourd, Francis
[J]. COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (08) : 1464 - 1471
[48] Ant colony optimization for single machine total weighted earliness/tardiness problem
Song, Y
Zhang, ZH
Zheng, L
[J]. PROCEEDINGS OF THE 11TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1 AND 2: INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT IN THE GLOBAL ECONOMY, 2005, : 301 - 305
[49] Minimizing weighted earliness and tardiness penalties in single-machine scheduling with idle time permitted
Chen, JY
Lin, SF
[J]. NAVAL RESEARCH LOGISTICS, 2002, 49 (08) : 760 - 780
[50] Scheduling about a common due date with job-dependent asymmetric earliness and tardiness penalties
Cai, X
Lum, VYS
Chan, JMT
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 98 (01) : 154 - 168

← 1 2 3 4 5 →