A Problem in Single-Machine Sequencing with Nonlinear Delay Costs
We examine a class of single-machine sequencing problems which originate from scheduling considerations for a single-server queueing system with nonlinear costs of delay. Associated with each request awaiting service (sequencing) are a known service time, a known arrival time, and a nondecreasing cost function which is identical for each request. Two sequencing problems are considered; a request incurs cost from its arrival time to the time when it (1) commences service or (2) completes service. Our objective is a sequence which minimizes the total incurred cost. Necessary conditions for the optimal sequencing of requests are given for convex nondecreasing and quadratic cost functions. These conditions and a new lower bound function are used in a branch-and-bound algorithm to obtain computational results.
Year of publication: |
1976
|
---|---|
Authors: | Henderson, Peter B. ; Steiglitz, Kenneth |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 22.1976, 12, p. 1342-1350
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
A problem in single-machine sequencing with nonlinear delay costs
Henderson, Peter B., (1976)
-
[Rezension von: Steiglitz, Kenneth, Snipers, shills, & sharks, eBay and human behavior]
Lewis, Gregory, (2008)
-
Snipers, shills, & sharks : eBay and human behavior
Steiglitz, Kenneth, (2007)
- More ...