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...

Full description

Bibliographic Details

Published in:	IEEE transactions on systems, man, and cybernetics. Systems Vol. 46; no. 11; pp. 1578 - 1588
Main Authors:	Yunqiang Yin, Cheng, Tai Chiu Edwin, Dujuan Wang, Chin-Chia Wu
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.11.2016 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!