Preemptive scheduling with availability constraints to minimize total weighted completion times (Q1772973): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57185955, #quickstatements; #temporary_batch_1714942991822
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Single machine flow-time scheduling with a single breakdown / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling with Release Dates / 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: Machine scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Current trends in deterministic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with limited machine availability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of \(\alpha\)-points in preemptive single machine scheduling. / rank
 
Normal rank

Latest revision as of 10:26, 10 June 2024

scientific article
Language Label Description Also known as
English
Preemptive scheduling with availability constraints to minimize total weighted completion times
scientific article

    Statements