An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time (Q2084598): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Yu-Zhong Zhang / rank
Normal rank
 
Property / author
 
Property / author: Yu-Zhong Zhang / 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/s10878-020-00594-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3028894538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal common due-date with limited completion time deviation / 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 scheduling to minimize earliness-tardiness and batch delivery costs with a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness-tardiness scheduling problems with a common delivery window / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of common due window location in a single machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Common due window size and location determination in a single machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A due-window assignment problem with position-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a maintenance activity and due-window assignment on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supply chain scheduling to minimize holding costs with outsourcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing weighted number of early and tardy jobs with a common due window involving location penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Scheduling of a Single-Supplier Single-Manufacturer Supply Chain With Common due Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine common due window assignment and scheduling to minimize the total cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3132646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-stage medical supply chain scheduling with an assignable common due window and shelf life / rank
 
Normal rank

Latest revision as of 13:20, 30 July 2024

scientific article
Language Label Description Also known as
English
An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time
scientific article

    Statements

    An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time (English)
    0 references
    0 references
    0 references
    0 references
    18 October 2022
    0 references
    supply chain scheduling
    0 references
    due window assignment
    0 references
    holding time
    0 references
    approximation algorithm
    0 references
    fully polynomial-time approximation scheme
    0 references
    0 references

    Identifiers