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
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129727404, #quickstatements; #temporary_batch_1728295585747 |
||
| (One intermediate revision by one other user not shown) | |||
| 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
16 October 2018
0 references
scheduling
0 references
incompatible family jobs
0 references
online algorithm
0 references
competitive ratio
0 references
0 references
0 references
0 references
0 references
