Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers (Q2412847): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10957-016-1056-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2574347234 / rank | |||
Normal rank | |||
Revision as of 02:21, 20 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
