Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times (Q2820105): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Scheduling equal-length jobs on identical parallel machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3178057 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling jobs with equal processing times and time windows on identical parallel machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A 1. 47-approximation for a preemptive single-machine scheduling problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2743967 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3217922 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4124328 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling / rank | |||
Normal rank |
Latest revision as of 13:38, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times |
scientific article |
Statements
Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times (English)
0 references
13 September 2016
0 references
single machine scheduling
0 references
lower bound
0 references
upper bound
0 references
assignment problem
0 references
weighted completion time
0 references
equal processing times
0 references
release dates
0 references
0 references