Optimally rescheduling jobs with a last-in-first-out buffer (Q2066687): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10951-021-00707-5 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3201288902 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2106.15901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set-up coordination between two stages of a supply chain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supply chain scheduling: sequence coordination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Price of fairness in two-agent single-machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling and rescheduling elective patients in operating rooms to minimise the percentage of tardy patients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-machine flow-shop problem with weighted late work criterion and common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust single machine scheduling with a flexible maintenance activity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rescheduling for Job Unavailability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rescheduling for Multiple New Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive Two-Agent Scheduling and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributionally robust single machine scheduling with the total tardiness criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of dynamic scheduling in manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rescheduling manufacturing systems: A framework of strategies, policies, and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-machine rescheduling heuristics with efficiency and stability as criteria / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10951-021-00707-5 / rank
 
Normal rank

Latest revision as of 22:43, 16 December 2024

scientific article
Language Label Description Also known as
English
Optimally rescheduling jobs with a last-in-first-out buffer
scientific article

    Statements

    Optimally rescheduling jobs with a last-in-first-out buffer (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 January 2022
    0 references
    scheduling
    0 references
    rescheduling
    0 references
    sequence coordination
    0 references
    supply chain sustainability
    0 references
    dynamic programming algorithms
    0 references
    complexity
    0 references

    Identifiers

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