Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery (Q4689384): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q129727404, #quickstatements; #temporary_batch_1728295585747
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan / 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: Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Parallel Machines On-Line / 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: On-line scheduling with delivery time on a single batch machine / 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: Online over time scheduling on parallel-batch machines: a survey / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0217595918500264 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2808445076 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129727404 / rank
 
Normal rank

Latest revision as of 11:32, 7 October 2024

scientific article; zbMATH DE number 6954990
Language Label Description Also known as
English
Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery
scientific article; zbMATH DE number 6954990

    Statements

    Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery (English)
    0 references
    0 references
    0 references
    16 October 2018
    0 references
    scheduling
    0 references
    incompatible family jobs
    0 references
    online algorithm
    0 references
    competitive ratio
    0 references

    Identifiers