Formulating the single machine sequencing problem with release dates as a mixed integer program (Q909575): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(90)90104-k / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2159152246 / rank | |||
Normal rank | |||
Revision as of 08:33, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Formulating the single machine sequencing problem with release dates as a mixed integer program |
scientific article |
Statements
Formulating the single machine sequencing problem with release dates as a mixed integer program (English)
0 references
1990
0 references
The paper deals with the problem of sequencing n jobs for single machine processing when release dates of jobs are given. The subject is to minimize the weighted sum of start times of jobs (or, equivalently, weighted sum of completion times). The authors consider a sequence of relaxations of the problem. The relaxations consist in replacing release dates for equal jobs by zeros. The relaxed problems are formulated in terms of linear programming problems. One of the main results described in the papeer lies in obtaining new lower bounds for the initial problem.
0 references
sequencing
0 references
single machine
0 references
release dates
0 references
weighted sum of start times
0 references
weighted sum of completion times
0 references
sequence of relaxations
0 references
lower bounds
0 references
0 references
0 references
