A Computational Study of the Job-Shop Scheduling Problem (Q4025904): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q56698006, #quickstatements; #temporary_batch_1712111774907 |
||
| (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.1287/ijoc.3.2.149 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2071306171 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56698006 / rank | |||
Normal rank | |||
Latest revision as of 04:55, 3 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Computational Study of the Job-Shop Scheduling Problem |
scientific article |
Statements
A Computational Study of the Job-Shop Scheduling Problem (English)
0 references
18 February 1993
0 references
job-shop scheduling
0 references
heuristic procedure
0 references
cutting-plane method
0 references
lower bounds
0 references
branch and bound
0 references
