Stochastic sequencing with job families, set-up times, and due dates

We consider the problem of allocating a single server to families of jobs with random service times and due dates. Furthermore, a set-up is required when the server switches from one job family to another. We address the problems of minimizing expected weighted flow time, expected maximum lateness,...

Full description

Saved in:
Bibliographic Details
Published in:International journal of systems science 1999, Vol.30 (2), p.175-181
Main Author: Van Oyen, Mark P.
Format: Article
Language:English
Subjects:
Applied sciences
Exact sciences and technology
Operational research and scientific management
Operational research. Management science
Scheduling, sequencing
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider the problem of allocating a single server to families of jobs with random service times and due dates. Furthermore, a set-up is required when the server switches from one job family to another. We address the problems of minimizing expected weighted flow time, expected maximum lateness, and total weighted tardiness with emphasis on problems for which it is assumed that each family can be set up only once (the Group Technology assumption). We derive conditions under which simple sequencing rules are optimal for each of these problems with group technology.
ISSN:0020-7721
1464-5319
DOI:10.1080/002077299292524