A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization (Q5131718): 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.1287/ijoc.2017.0772 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2784652060 / rank | |||
Normal rank | |||
Revision as of 23:53, 19 March 2024
scientific article; zbMATH DE number 7271631
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization |
scientific article; zbMATH DE number 7271631 |
Statements
A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization (English)
0 references
9 November 2020
0 references
prize-collecting
0 references
single-machine scheduling
0 references
integer linear programming
0 references
branch and bound
0 references
