On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates (Q2093185): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-022-00743-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4283446493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the maximum deviation of job completion time about a common due-date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unary NP-hardness of minimizing total weighted tardiness with generalized due dates / 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: On the complexity of generalized due date scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling to minimize the number of early and tardy jobs / 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: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent single-machine scheduling with assignable due dates / rank
 
Normal rank

Latest revision as of 18:26, 30 July 2024

scientific article
Language Label Description Also known as
English
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates
scientific article

    Statements

    On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates (English)
    0 references
    0 references
    0 references
    0 references
    4 November 2022
    0 references
    0 references
    scheduling
    0 references
    single machine
    0 references
    generalized due-dates
    0 references
    \(\mathcal{NP}\)-hard
    0 references
    pseudo-polynomial time algorithm
    0 references
    parameterized complexity
    0 references
    0 references