A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES (Q2931730): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Control of a batch-processing machine: A computational approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling a batching machine / 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: Scheduling one batch processor subject to job release dates / 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: Online scheduling on unbounded parallel-batch machines to minimize the makespan / rank | |||
Normal rank |
Revision as of 09:17, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES |
scientific article |
Statements
A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES (English)
0 references
26 November 2014
0 references
scheduling
0 references
online algorithm
0 references
parallel batch
0 references
maximum flow-time
0 references
competitive ratio
0 references