06-37
A Flow Formulation for the One-Machine Scheduling Problem with Chain Precedence Relations
by Servilio, M.; Wagler, A.; Weismantel, R.
Preprint series: 06-37, Preprints
- MSC:
- 90C27 Combinatorial optimization
- 90C90 Applications of mathematical programming
Abstract: We consider a one-machine scheduling problem with chain precedence constraints in order to send data packets through a single channel in a UMT-system. We propose a flow formulation that allows to solve the problem in polynomial time, for a fixed number of users.
Keywords: 1-machine scheduling, flow formulation
The author(s) agree, that this abstract may be stored asfull text and distributed as such by abstracting services.