Single machine batch scheduling with two competing agents to minimize total flowtime (Q420859): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6037815 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
two-agent scheduling | |||
| Property / zbMATH Keywords: two-agent scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
batch scheduling | |||
| Property / zbMATH Keywords: batch scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
single machine | |||
| Property / zbMATH Keywords: single machine / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
flowtime | |||
| Property / zbMATH Keywords: flowtime / rank | |||
Normal rank | |||
Revision as of 21:39, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single machine batch scheduling with two competing agents to minimize total flowtime |
scientific article |
Statements
Single machine batch scheduling with two competing agents to minimize total flowtime (English)
0 references
23 May 2012
0 references
two-agent scheduling
0 references
batch scheduling
0 references
single machine
0 references
flowtime
0 references
