Improved Algorithms for Single-Machine Serial-Batch Scheduling With Rejection to Minimize Total Completion Time and Total Rejection Cost

Recently, Shabtay considered a scheduling problem on a single serial-batching machine with rejection to minimize the dual criteria of total completion time and total rejection cost, where the number of jobs to be included in each batch is not restricted. He studied four variants of the problem: the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on systems, man, and cybernetics. Systems Jg. 46; H. 11; S. 1578 - 1588
Hauptverfasser: Yunqiang Yin, Cheng, Tai Chiu Edwin, Dujuan Wang, Chin-Chia Wu
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.11.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Approximation algorithms
Approximation methods
Batch processing
Batch scheduling
bicriterion scheduling
dynamic programming
Dynamic scheduling
Heuristic algorithms
Job shop scheduling
Production scheduling
rejection
Single machine scheduling
total completion time
ISSN:2168-2216, 2168-2232
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Recently, Shabtay considered a scheduling problem on a single serial-batching machine with rejection to minimize the dual criteria of total completion time and total rejection cost, where the number of jobs to be included in each batch is not restricted. He studied four variants of the problem: the first is to minimize the sum of the two criteria; the second and third are to minimize one criterion, subject to the other criterion not exceeding a given value; and the last is to find the Pareto-optimal solutions for the bicriterion problem. Shabtay provided an O(n 5 ) algorithm for the first variant and an O(n 6 /ε 2 ) fully polynomialtime approximation scheme (FPTAS) for the fourth variant. In this paper, we provide an alternative O(n 4 ) algorithm to solve the first variant and an O(n 5 /ε) FPTAS for the fourth variant, which are more efficient than those developed by Shabtay from a theoretical perspective. However, when the size of each batch is bounded by a given number b > 1, the corresponding time complexities of our algorithms for the first and fourth variants reduce to O(bn 3 ) and O(bn 4 /ε), respectively.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2168-2216
2168-2232
DOI:10.1109/TSMC.2015.2505644