Polynomial algorithms for single machine scheduling problems with financial constraints

Authors:
Jinxing Xie
Affiliations:
Department of Applied Mathematics, Tsinghua University, Beijing 100084, People's Republic of China
Venue:
Operations Research Letters
Year:
1997

Citing 1
Cited 4

Scheduling subject to nonrenewable-resource constraints

Operations Research Letters

On the relocation problem with a second working crew for resource recycling

International Journal of Systems Science
Tight complexity analysis of the relocation problem with arbitrary release dates

Theoretical Computer Science
Resource-constrained flowshop scheduling with separate resource recycling operations

Computers and Operations Research
On relocation problems with multiple identical working crews

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with the single machine scheduling problem with multiple financial resource constraints. It is shown that the problem can be reduced to the two machine flow shop scheduling problem if the financial resources arrive uniformly over time, and it is also shown that the LPT (Largest Processing Time) rule generates an optimal solution to the problem if the financial resources are consumed uniformly by all the kobs. Hence there exist polynomial algorithms for these two special cases of the problem.