The Library
Integer preemptive scheduling on parallel machines
Tools
Tools
Tools
Baptiste, Ph., Carlier, J., Kononov, A., Queyranne, M., Sevastyanov, S. and Sviridenko, Maxim (2012) Integer preemptive scheduling on parallel machines. Operations Research Letters, Vol.40 (No.6). pp. 440-444. doi:10.1016/j.orl.2012.06.011
Research output not available from this repository, contact author.
Official URL: http://dx.doi.org/10.1016/j.orl.2012.06.011
Abstract
We consider preemptive machine scheduling problems on identical parallel machines. It is shown that every such problem with chain-like precedence constraints, release dates and a regular unit-concave objective function (e.g. total weighted tardiness and total weighted number of late jobs) has the following integer preemption property: for any problem instance with integral input data there exists an optimal schedule where all interruptions (as well as starting and completion times of jobs) occur at integer time points.
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Divisions: | Faculty of Science > Computer Science | ||||
| Journal or Publication Title: | Operations Research Letters | ||||
| Publisher: | Elsevier BV | ||||
| ISSN: | 0167-6377 | ||||
| Official Date: | 2012 | ||||
| Dates: |
|
||||
| Volume: | Vol.40 | ||||
| Number: | No.6 | ||||
| Page Range: | pp. 440-444 | ||||
| DOI: | 10.1016/j.orl.2012.06.011 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published | ||||
| Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
