Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers (Q2412847): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q59603339, #quickstatements; #temporary_batch_1711565664090 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59603339 / rank | |||
Normal rank | |||
Revision as of 21:02, 27 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers |
scientific article |
Statements
Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers (English)
0 references
27 October 2017
0 references
flexible manufacturing system
0 references
single machine
0 references
one depot
0 references
one vehicle
0 references
NP-hardness proof
0 references
approximation algorithm
0 references
