The mixed shop scheduling problem (Q1067989): 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 / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank | |||
Normal rank | |||
Latest revision as of 19:45, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The mixed shop scheduling problem |
scientific article |
Statements
The mixed shop scheduling problem (English)
0 references
1985
0 references
The two-machine shop scheduling problem has been solved by Johnson and Gonzalez/Sahni if the jobs are flow shop type and open shop type, respectively. The authors develop a solution procedure where both job types occur. While this problem has been solved by Jackson for given processing orders of the two machines, the new procedure allows the flexibility of the processing order.
0 references
two-machine shop scheduling
0 references
flow shop
0 references
open shop
0 references
