An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer (Q4390594): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| label / en | label / en | ||
An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer | |||
| Property / author | |||
| Property / author: Alessandro Agnetis / rank | |||
| Property / author | |||
| Property / author: Alessandro Agnetis / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199803)45:2<141::aid-nav2>3.0.co;2-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027725385 / rank | |||
Normal rank | |||
| Property / title | |||
An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer (English) | |||
| Property / title: An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer (English) / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:13, 30 July 2024
scientific article; zbMATH DE number 1156570
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer |
scientific article; zbMATH DE number 1156570 |
Statements
26 May 1998
0 references
makespan minimization
0 references
flow shop
0 references
two machines
0 references
exact branch-and-bound
0 references
An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer (English)
0 references
