An efficient ILP formulation for the single machine scheduling problem (Q5189883): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2155938357 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The one-machine sequencing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Characterizing the set of feasible sequences for n jobs to be carried out on a single machine / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A New Dominance Concept in Scheduling <i>n</i> Jobs on a Single Machine with Ready Times and Due Dates / 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: Q4124328 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 13:45, 2 July 2024
scientific article; zbMATH DE number 5680415
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient ILP formulation for the single machine scheduling problem |
scientific article; zbMATH DE number 5680415 |
Statements
An efficient ILP formulation for the single machine scheduling problem (English)
0 references
11 March 2010
0 references
single machine scheduling
0 references
integer linear programming
0 references
dominance conditions
0 references
0 references
0 references
0 references
