Online Scheduling on Two Parallel Machines with Release Times and Delivery Times (Q2867111): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Xi-wen Lu / rank
Normal rank
 
Property / author
 
Property / author: Xi-wen Lu / 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/978-3-319-03780-6_9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2404565765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with release dates and tails on identical machines to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling on identical machines: How good is LPT in an on-line setting? / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on parallel machines subject to release dates and delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate decomposition algorithm for scheduling on parallel machines with heads and tails / rank
 
Normal rank
Property / cites work
 
Property / cites work: A block approach for single-machine scheduling with release dates and due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for scheduling on identical parallel machines with heads and tails / 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: An optimal online algorithm for single machine scheduling with bounded delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximation schemes for scheduling problems with release dates and delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal online algorithm for scheduling two machines with release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized algorithms for on-line scheduling problems: How low can't you go? / 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: Q4368485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for parallel machine scheduling with delivery times / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:17, 7 July 2024

scientific article
Language Label Description Also known as
English
Online Scheduling on Two Parallel Machines with Release Times and Delivery Times
scientific article

    Statements

    Online Scheduling on Two Parallel Machines with Release Times and Delivery Times (English)
    0 references
    0 references
    0 references
    10 December 2013
    0 references
    0 references
    scheduling
    0 references
    delivery times
    0 references
    parallel machines
    0 references
    online algorithm
    0 references
    0 references
    0 references