A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios (Q1956478): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/s12597-009-0026-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051419134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date / 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: Scheduling around a small common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to minimize weighted earliness and tardiness about a common due-date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted common due date single machine scheduling problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine / rank
 
Normal rank

Latest revision as of 06:39, 3 July 2024

scientific article
Language Label Description Also known as
English
A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios
scientific article

    Statements

    Identifiers