The Machine Duplication Problem in a Job Shop with Two Jobs (Q5689969): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
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.1111/j.1475-3995.1995.tb00004.x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4250863829 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An efficient algorithm for the job-shop problem with two jobs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3938812 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of shop-scheduling problems with two or three jobs / rank | |||
Normal rank | |||
Latest revision as of 10:17, 27 May 2024
scientific article; zbMATH DE number 966581
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Machine Duplication Problem in a Job Shop with Two Jobs |
scientific article; zbMATH DE number 966581 |
Statements
The Machine Duplication Problem in a Job Shop with Two Jobs (English)
0 references
15 January 1997
0 references
NP-completeness
0 references
job shop scheduling
0 references
flexible manufacturing cells
0 references
complexity of the machine duplication problem
0 references
polynomial time
0 references
heuristic
0 references
