Online over time scheduling on parallel-batch machines: a survey (Q489147): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6391367 / rank
 
Normal rank
Property / zbMATH Keywords
 
online scheduling
Property / zbMATH Keywords: online scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
parallel-batch machines
Property / zbMATH Keywords: parallel-batch machines / rank
 
Normal rank
Property / zbMATH Keywords
 
competitive ratio
Property / zbMATH Keywords: competitive ratio / 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/s40305-014-0060-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004572055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control of a batch-processing machine: A computational approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching and delivery in semi-online distribution systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4396949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for single-machine problems with positive finish-start time-lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling a batch processing system to minimize total weighted job completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-on-line multiprocessor scheduling with given total processing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms in batch processing / 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: Online batch scheduling on parallel machines with delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan / 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: Online scheduling in a parallel batch processing system to minimize makespan using restarts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling on a batch machine to minimize makespan with limited restarts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling with Known Arrival Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal on-line algorithms for single-machine scheduling / 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: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals / 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: Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling one batch processor subject to job release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online unbounded batch scheduling on parallel machines with delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in batch machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A flexible on-line scheduling algorithm for batch machine with infinite capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling algorithms for a batch machine with finite capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling with decreasing job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-on-line problems on two identical machines with combined partial information / 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: Online scheduling on unbounded parallel-batch machines to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: A best online algorithm for scheduling on two parallel batch machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on unbounded parallel-batch machines with incompatible job families / 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: 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: A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best semi-online algorithms for unbounded parallel batch scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for minimizing makespan on batch processing machines / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 13:55, 9 July 2024

scientific article
Language Label Description Also known as
English
Online over time scheduling on parallel-batch machines: a survey
scientific article

    Statements

    Online over time scheduling on parallel-batch machines: a survey (English)
    0 references
    0 references
    0 references
    0 references
    27 January 2015
    0 references
    online scheduling
    0 references
    parallel-batch machines
    0 references
    competitive ratio
    0 references
    0 references
    0 references

    Identifiers