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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2014.11.103 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1967768830 / rank | |||
Normal rank | |||
Revision as of 21:54, 19 March 2024
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
