An efficient algorithm for the job-shop problem with two jobs (Q1108919): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02276919 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W201573687 / rank | |||
Normal rank | |||
Latest revision as of 11:32, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for the job-shop problem with two jobs |
scientific article |
Statements
An efficient algorithm for the job-shop problem with two jobs (English)
0 references
1988
0 references
job-shop scheduling
0 references
two jobs
0 references
shortest path
0 references
obstacles in the plane
0 references
special network
0 references
0 references
