A cyclical search for the two machine flow shop and open shop to minimise finishing time (Q2356124): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| 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.1007/s10951-013-0356-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2068762498 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Three is easy, two is hard: Open shop sum-batch scheduling problem refined / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3964013 / rank | |||
Normal rank | |||
Latest revision as of 13:35, 10 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A cyclical search for the two machine flow shop and open shop to minimise finishing time |
scientific article |
Statements
A cyclical search for the two machine flow shop and open shop to minimise finishing time (English)
0 references
28 July 2015
0 references
flow shop
0 references
open shop
0 references
minimum makespan
0 references
