Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem (Q2491772): 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.ejor.2004.11.022 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2051692678 / rank | |||
Normal rank | |||
Revision as of 00:11, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem |
scientific article |
Statements
Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem (English)
0 references
29 May 2006
0 references
scheduling
0 references
single machine
0 references
earliness-tardiness cost
0 references
neighborhoods
0 references
search method
0 references
