On the complexity of the single machine scheduling problem minimizing total weighted delay penalty (Q1785249): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Minimization of Half-Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Mean Squared Deviation of Completion Times About a Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling to minimize total weighted tardiness / 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: FPTAS for half-products minimization with scheduling applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling around a small common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for minclique scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completion time variance minimization on a single machine is difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual Techniques for Scheduling on a Machine with Varying Speed / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved precedence rule for single machine sequencing problems with quadratic penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm to minimize mean squared deviation of job completion times about a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling about a given common due date to minimize mean squared deviation of completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4034337 / rank
 
Normal rank

Latest revision as of 16:44, 16 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
scientific article

    Statements

    On the complexity of the single machine scheduling problem minimizing total weighted delay penalty (English)
    0 references
    28 September 2018
    0 references
    scheduling
    0 references
    penalty function
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references

    Identifiers