A polynomial algorithm for 2-degree cyclic robot scheduling (Q1869423): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57185970, #quickstatements; #temporary_batch_1710979808849 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An improved algorithm for cyclic flowshop scheduling in a robotic cell / rank | |||
Normal rank | |||
Revision as of 15:12, 5 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for 2-degree cyclic robot scheduling |
scientific article |
Statements
A polynomial algorithm for 2-degree cyclic robot scheduling (English)
0 references
10 April 2003
0 references
cyclic scheduling
0 references
transporting robot
0 references
cycle time minimization
0 references
complexity
0 references
