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

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

0.00 Avg rating0 Votes
Article ID: iaor20011316
Country: United States
Volume: 30
Issue: 2
Start Page Number: 175
End Page Number: 181
Publication Date: Feb 1999
Journal: International Journal of Systems Science
Authors: , ,
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.