Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/24188
Title: Single machine group scheduling with two ordered criteria
Authors: Cheng, TCE 
Kovalyov, MY
Tuzikov, AV
Keywords: Bicriterion scheduling
Single machine group scheduling
Issue Date: 1996
Source: Journal of the Operational Research Society, 1996, v. 47, no. 2, p. 315-320 How to cite?
Journal: Journal of the Operational Research Society 
Abstract: The problem of scheduling jobs on a single machine is considered. It is assumed that the jobs are classified into several groups and the jobs of the same group have to be processed contiguously. A sequence independent set-up time is incurred between each two consecutively scheduled groups. A schedule is specified by a sequence for the groups and a sequence for the jobs in each group. The quality of a schedule is measured by two critera ordered by their relative importance. The objective is to minimize the maximum cost, the secondary criterion, subject to the schedule is optimal with respect to total weighted completion time, the primary criterion. A polynomial time algorithm is presented to solve this bicriterion group scheduling problem. It is shown that this algorithm can also be modified to solve the single machine group scheduling problem with several ordered maximum cost criteria and arbitrary precedence constraints.
URI: http://hdl.handle.net/10397/24188
ISSN: 0160-5682
DOI: 10.1057/jors.1996.27
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

13
Citations as of Jan 14, 2017

WEB OF SCIENCETM
Citations

11
Last Week
0
Last month
0
Citations as of Jan 15, 2017

Page view(s)

24
Last Week
0
Last month
Checked on Jan 15, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.