An efficient algorithm for the job-shop problem with two jobs (Q1108919): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4091421 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Adjustment of heads and tails for the job-shop problem / 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: An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solution of the Akers-Friedman Scheduling Problem / rank | |||
Normal rank | |||
Revision as of 18:00, 18 June 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
