Polynomial algorithms for single machine scheduling problems with financial constraints

Operations Research Letters

Volumn 21, Issue 1, 1997, Pages 39-42

  Xie, Jinxing ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Financial constraints; Polynomial algorithms; Single machine scheduling

Indexed keywords

EID: 0041731457     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6377(97)00007-2     Document Type: Article

References (5)

1. J. Carlier, "Complexité des problèmes d'ordonnancement à constraintes de financement", in: P. Hansen, D. de Werra (eds.), Regards sur la Théorie des Graphes, Presses Polytechniques Romandes, Lausanne, 1980, pp. 183-186.
2. J. Carlier and A.H.G. Rinnooy Kan, "Scheduling subject to nonrenewable-resource constraints", Oper. Res. Lett. 1, 52-55 (1982).
3. S.M. Johnson, "Optimal two and three stage production schedules with setup time included", Naval Res. Logist. Quart. 1, 61-68 (1954).
4. R. Slowinski, "Preemptive scheduling of independence jobs on parallel machine subject to financial constraints", European J. Oper. Res. 15, 366-373 (1984).
5. A. Toker, S. Kondakci and N. Erkip, "Scheduling under a non-renewable resource constraint", J. Oper. Res. Soc. 42, 811-814 (1991).