The two-machine no-wait general and proportionate open shop makespan problem (Q296784): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6597516 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
scheduling | |||
| Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
open shop | |||
| Property / zbMATH Keywords: open shop / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
no wait | |||
| Property / zbMATH Keywords: no wait / rank | |||
Normal rank | |||
Revision as of 21:01, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The two-machine no-wait general and proportionate open shop makespan problem |
scientific article |
Statements
The two-machine no-wait general and proportionate open shop makespan problem (English)
0 references
23 June 2016
0 references
scheduling
0 references
open shop
0 references
no wait
0 references
