Integer preemptive scheduling on parallel machines (Q1939681): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of optimal schedules in preemptive shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On preemption redundancy in scheduling unit processing time jobs on two parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: How useful are preemptive schedules? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling chain-structured tasks to minimize makespan and mean flow time / 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: Q5184270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank

Revision as of 05:32, 6 July 2024

scientific article
Language Label Description Also known as
English
Integer preemptive scheduling on parallel machines
scientific article

    Statements

    Identifiers