A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 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.1007/s10951-022-00731-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4226299618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Models of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shop scheduling problem with an outsourcing option / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with release times, deadlines, setup times, and rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parametric complexity of schedules to minimize tardy tasks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of simultaneous diophantine approximation in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming in Parameterized Complexity: Three Miniatures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of integer quasiconvex polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop-scheduling problems with makespan criterion: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for minimizing the weighted number of tardy jobs on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized multi-scenario single-machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized tractability of single machine scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized tractability of the just-in-time flow-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural parameters for scheduling with assignment restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling meets \(n\)-fold integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / 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: Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow-shop scheduling with rejection / 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: Minimizing total weighted completion time in a proportionate flow shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width / 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: New results on two-machine flow-shop scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling under the job rejection constraint / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:42, 29 July 2024

scientific article
Language Label Description Also known as
English
A general scheme for solving a large set of scheduling problems with rejection in FPT time
scientific article

    Statements

    A general scheme for solving a large set of scheduling problems with rejection in FPT time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 May 2022
    0 references
    scheduling with rejection
    0 references
    fixed parameter tractable
    0 references
    single machine
    0 references
    parallel machines
    0 references
    flow-shop
    0 references
    \( \mathcal{NP} \)-hard
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references