A bicriterion approach to time/cost trade-offs in sequencing
โ Scribed by Luk N. Van Wassenhove; Kenneth R. Baker
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 363 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
โฆ Synopsis
Tiffs paper discusses a bieriterion approach to sequencing with tlme/cost tnlde-offs, This approach, which produces an efficient frontier of possible schedules, has the fidv'mtage that it does not require tile sequencing criteria to be measurable in the sllnle ilnils as the resource allocation cost, The basic singlemachine mt?del is used to treat a class of problems in which the sequencing objective is to minimize the maximum completion penalty, h is further assumed that resource allocation costs can he represented by a linear time/cost function.
๐ SIMILAR VOLUMES
Task allocation is the process that adjusts the number of workers in each colony task in response to the environment. There is no central coordination of task allocation; instead workers use local cues from the environment and from other workers to decide which task to perform. We examine two aspect