Formulating the single machine sequencing problem with release dates as a mixed integer program (Q909575): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56324122, #quickstatements; #temporary_batch_1705750702424 |
Created claim: DBLP publication ID (P1635): journals/dam/DyerW90, #quickstatements; #temporary_batch_1731530891435 |
||
| (6 intermediate revisions by 5 users not shown) | |||
| Property / author | |||
| Property / author: Martin Dyer / rank | |||
| Property / author | |||
| Property / author: Laurence A. Wolsey / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Ya. M. Shafransky / rank | |||
| Property / author | |||
| Property / author: Martin Dyer / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Laurence A. Wolsey / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Ya. M. Shafransky / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the facial structure of scheduling polyhedra / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4194705 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3790929 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing Weighted Completion Times with Deadlines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Sequencing Problem with Release Dates and Clustered Jobs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm for single machine sequencing with deadlines to minimize total weighted completion time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4068433 / rank | |||
Normal rank | |||
| 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 | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/dam/DyerW90 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:58, 13 November 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
