A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization (Q298761): 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: 90C57 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6595835 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
scheduling | |||
| Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
single machine | |||
| Property / zbMATH Keywords: single machine / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
maximum delivery time | |||
| Property / zbMATH Keywords: maximum delivery time / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
non-availability constraint | |||
| Property / zbMATH Keywords: non-availability constraint / rank | |||
Normal rank | |||
Revision as of 22:26, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization |
scientific article |
Statements
A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization (English)
0 references
21 June 2016
0 references
scheduling
0 references
single machine
0 references
maximum delivery time
0 references
non-availability constraint
0 references
