A no-delay single machine scheduling problem to minimize total weighted early and late work (Q6063508): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11590-022-01849-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4210303430 / rank | |||
Normal rank | |||
Revision as of 10:45, 30 July 2024
scientific article; zbMATH DE number 7762292
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A no-delay single machine scheduling problem to minimize total weighted early and late work |
scientific article; zbMATH DE number 7762292 |
Statements
A no-delay single machine scheduling problem to minimize total weighted early and late work (English)
0 references
7 November 2023
0 references
single machine scheduling
0 references
early and late work
0 references
general variable neighborhood search
0 references
GRASP-VND
0 references
0-1 integer programming
0 references
