Scheduling jobs with release times on a machine with finite storage (Q1330556)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling jobs with release times on a machine with finite storage |
scientific article |
Statements
Scheduling jobs with release times on a machine with finite storage (English)
0 references
18 August 1994
0 references
The problem considered is one of scheduling \(n\) jobs on one machine. Jobs are nonpreemptable and they are characterized by arbitrary processing and arrival times as well as weights. The machine is characterized by a buffer which can store up to \(b\) waiting jobs. A job arriving at some time to the system is lost if it is \((b+ 1)\)st on the waiting list. The objective is to find a maximum weight subset of jobs that can be processed without violating the buffer's capacity constraint at a time. The complexity of the above problem is studied.
0 references
deadlines
0 references
one machine
0 references
nonpreemptable
0 references
arbitrary processing and arrival times
0 references
buffer
0 references
