On the parameterized tractability of single machine scheduling with rejection (Q1991260): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q129483628, #quickstatements; #temporary_batch_1725407685744
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Michael L. Pinedo / rank
Normal rank
 
Property / author
 
Property / author: Michael L. Pinedo / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2018.07.038 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2883474883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval scheduling and colorful independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / 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: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling meets \(n\)-fold integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of machine scheduling: 15 open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling and fixed-parameter tractability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on offline scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriteria approach to scheduling a single machine with job rejection and positional penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling under the job rejection constraint / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129483628 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:00, 4 September 2024

scientific article
Language Label Description Also known as
English
On the parameterized tractability of single machine scheduling with rejection
scientific article

    Statements

    On the parameterized tractability of single machine scheduling with rejection (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 October 2018
    0 references
    single machine scheduling
    0 references
    scheduling with rejection
    0 references
    parameterized complexity
    0 references
    fixed-parameter tractability
    0 references

    Identifiers