A note on scheduling problems with competing agents and earliness minimization objectives (Q319703): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(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.1016/j.ejor.2015.04.006 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2059543744 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling Problems with Two Competing Agents / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multi-agent single machine scheduling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Competitive Two-Agent Scheduling and Its Applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling problems with two competing agents to minimize minmax and minsum earliness measures / rank | |||
Normal rank |
Latest revision as of 16:42, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on scheduling problems with competing agents and earliness minimization objectives |
scientific article |
Statements
A note on scheduling problems with competing agents and earliness minimization objectives (English)
0 references
6 October 2016
0 references
scheduling
0 references