On the approximability of an interval scheduling problem (Q1806343): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Is the Classroom Assignment Problem Hard? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Fixed Job Schedule Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for scheduling tasks with discrete starting times / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of scheduling tasks with discrete starting times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The assembly of printed circuit boards: A case with multiple machines and multiple board types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on scheduling intervals on-line / rank
 
Normal rank

Latest revision as of 08:56, 29 May 2024

scientific article
Language Label Description Also known as
English
On the approximability of an interval scheduling problem
scientific article

    Statements

    Identifiers