A flexible on-line scheduling algorithm for batch machine with infinite capacity (Q1772971): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Scheduling a batching machine / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2729097 / 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: Scheduling one batch processor subject to job release dates / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On-line algorithms for minimizing makespan on batch processing machines / rank | |||
Normal rank | |||
Revision as of 09:26, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A flexible on-line scheduling algorithm for batch machine with infinite capacity |
scientific article |
Statements
A flexible on-line scheduling algorithm for batch machine with infinite capacity (English)
0 references
22 April 2005
0 references
scheduling
0 references
batch
0 references
makespan
0 references
on-line
0 references
unbounded capacity
0 references
