The two-machine open shop problem: To fit or not to fit, that is the question (Q1811630): 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: Optimal two- and three-stage production schedules with setup times included / 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: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function / rank | |||
Normal rank | |||
Revision as of 17:37, 5 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The two-machine open shop problem: To fit or not to fit, that is the question |
scientific article |
Statements
The two-machine open shop problem: To fit or not to fit, that is the question (English)
0 references
17 June 2003
0 references
scheduling
0 references
sequencing
0 references
open shop scheduling
0 references
flow shop scheduling
0 references
bicriterion optimization
0 references
