Job-shop scheduling with multi-purpose machines (Q1174353): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / 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: A Geometric Model and a Graphical Algorithm for a Sequencing Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of shop-scheduling problems with two or three jobs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solution of the Akers-Friedman Scheduling Problem / rank | |||
Normal rank | |||
Latest revision as of 08:58, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Job-shop scheduling with multi-purpose machines |
scientific article |
Statements
Job-shop scheduling with multi-purpose machines (English)
0 references
25 June 1992
0 references
multi-purpose machines
0 references
