Single machine group scheduling to minimize mean flow time subject to due date constraints

This paper considers a single machine group scheduling problem. All jobs are classified into groups and the jobs within a group are processed contiguously on the machine. A sequence-independent setup time is incurred between each two consecutively scheduled groups. This paper presents a solution pro...

Full description

Saved in:
Bibliographic Details
Published inProduction planning & control Vol. 9; no. 4; pp. 366 - 370
Main Authors Pan, Jason Chao-Hsien, Wu, Chin-Chia
Format Journal Article
LanguageEnglish
Published Taylor & Francis Group 01.01.1998
Subjects
Group Technology
Maximum Tardiness
Mean Flow Time
Scheduling
Single Machine
Online AccessGet full text
ISSN0953-7287
1366-5871
DOI10.1080/095372898234091

Cover

More Information
Summary:This paper considers a single machine group scheduling problem. All jobs are classified into groups and the jobs within a group are processed contiguously on the machine. A sequence-independent setup time is incurred between each two consecutively scheduled groups. This paper presents a solution procedure which utilizes Smith's algorithm and a proposed modified Smith's algorithm to find an optimal job sequence and an optimal group sequence which minimizes the mean flow time of jobs subject to the constraint that no jobs are tardy. The complexity of the algorithm is shown to have a polynomial running time in the number of groups and jobs.
ISSN:0953-7287
1366-5871
DOI:10.1080/095372898234091