Single-machine online scheduling of jobs with non-delayed processing constraint (Q2045026): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1640601
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-021-00722-4 / rank
Normal rank
 
Property / author
 
Property / author: Wen-Jie Li / 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-021-00722-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3137929948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restarts can help in the on-line minimization of the maximum delivery time on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of scheduling problems with no-wait in process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal on-line algorithms for one batch machine with grouped processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: On no-wait and no-idle flow shops with makespan criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2948897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on bounded batch machines to minimize the maximum weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal online algorithm for single machine scheduling with bounded delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with two competing agents and equal job processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling with delivery time on a single batch machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A best on-line algorithm for single machine scheduling with small delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved on-line algorithm for single parallel-batch machine scheduling with delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online over time scheduling on parallel-batch machines: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with release dates and preemption to minimize multiple max-form objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria scheduling of equal length jobs on uniform parallel machines / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-021-00722-4 / rank
 
Normal rank

Latest revision as of 21:04, 16 December 2024

scientific article
Language Label Description Also known as
English
Single-machine online scheduling of jobs with non-delayed processing constraint
scientific article

    Statements

    Single-machine online scheduling of jobs with non-delayed processing constraint (English)
    0 references
    0 references
    0 references
    11 August 2021
    0 references
    online scheduling
    0 references
    weighted completion time
    0 references
    delivery time
    0 references
    non-delayed processing
    0 references
    0 references
    0 references
    0 references

    Identifiers