DISCRETE-CONTINUOUS SCHEDULING PROBLEMS - MEAN COMPLETION-TIME RESULTS

Authors
JOZEFOWSKA J WEGLARZ J
Citation
J. Jozefowska et J. Weglarz, DISCRETE-CONTINUOUS SCHEDULING PROBLEMS - MEAN COMPLETION-TIME RESULTS, European journal of operational research, 94(2), 1996, pp. 302-309
Citations number
7
Categorie Soggetti
Management,"Operatione Research & Management Science","Operatione Research & Management Science
Journal title
European journal of operational research → ACNP
ISSN journal
03772217
Volume
94
Issue
2
Year of publication
1996
Pages
302 - 309
Database
ISI
SICI code
0377-2217(1996)94:2<302:DSP-MC>2.0.ZU;2-#
Abstract
Problems of scheduling independent, nonpreemptable jobs on m parallel machines with an additional continuously divisible, renewable resource to minimize the mean completion time are considered. A job is describ ed by its processing demand and its processing rate being a continuous , nondecreasing function of the amount of the continuous resource allo tted to it at a time. Properties of optimal schedules are proved and t wo special cases with efficient solution algorithms are presented.