A scheduling problem with three competing agents (Q337134): 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: 6650712 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
scheduling | |||
Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
total weighted completion time | |||
Property / zbMATH Keywords: total weighted completion time / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
makespan | |||
Property / zbMATH Keywords: makespan / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
multiple-agent | |||
Property / zbMATH Keywords: multiple-agent / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
single-machine | |||
Property / zbMATH Keywords: single-machine / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
maintenance activity | |||
Property / zbMATH Keywords: maintenance activity / rank | |||
Normal rank |
Revision as of 05:22, 28 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A scheduling problem with three competing agents |
scientific article |
Statements
A scheduling problem with three competing agents (English)
0 references
10 November 2016
0 references
scheduling
0 references
total weighted completion time
0 references
makespan
0 references
multiple-agent
0 references
single-machine
0 references
maintenance activity
0 references