A single-machine bi-criterion scheduling problem with two agents (Q482429): 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: 6382673 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
scheduling | |||
| Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
total completion time | |||
| Property / zbMATH Keywords: total completion time / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
maximum tardiness | |||
| Property / zbMATH Keywords: maximum tardiness / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
two-agent | |||
| Property / zbMATH Keywords: two-agent / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
single-machine | |||
| Property / zbMATH Keywords: single-machine / rank | |||
Normal rank | |||
Revision as of 19:38, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A single-machine bi-criterion scheduling problem with two agents |
scientific article |
Statements
A single-machine bi-criterion scheduling problem with two agents (English)
0 references
30 December 2014
0 references
scheduling
0 references
total completion time
0 references
maximum tardiness
0 references
two-agent
0 references
single-machine
0 references
