Three-Machine Flowshop Scheduling Problem to Minimize Total Completion Time with Bounded Setup and Processing Times (Q3011180): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q129524974, #quickstatements; #temporary_batch_1730107797343 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129524974 / rank | |||
Normal rank | |||
Latest revision as of 10:35, 28 October 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Three-Machine Flowshop Scheduling Problem to Minimize Total Completion Time with Bounded Setup and Processing Times |
scientific article |
Statements
Three-Machine Flowshop Scheduling Problem to Minimize Total Completion Time with Bounded Setup and Processing Times (English)
0 references
28 June 2011
0 references
scheduling
0 references
flowshop
0 references
dominance relations
0 references
bounded processing and setup times
0 references
