Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times (Q611469): 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.camwa.2010.06.019 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2081821125 / rank | |||
Normal rank | |||
Revision as of 01:13, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times |
scientific article |
Statements
Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times (English)
0 references
14 December 2010
0 references
scheduling
0 references
flowshop
0 references
maximum lateness
0 references
random processing times
0 references
