A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates (Q2430605): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:35, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates |
scientific article |
Statements
A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates (English)
0 references
8 April 2011
0 references
scheduling
0 references
single machine
0 references
controllable processing times
0 references
convex resource consumption function
0 references
