Sequency on two and three machines with setup, processing and removal times separated (Q3664805): Difference between revisions
From MaRDI portal
Added link to MaRDI 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.1080/00207548308942406 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2014916545 / 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: Sequencing <i>n</i> Jobs on Two Machines with Arbitrary Time Lags / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Mathematical aspects of the 3 × n job-shop sequencing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Two-Machine Orderings in the 3 × <i>n</i> Flow-Shop Problem / rank | |||
Normal rank | |||
Latest revision as of 08:47, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sequency on two and three machines with setup, processing and removal times separated |
scientific article |
Statements
Sequency on two and three machines with setup, processing and removal times separated (English)
0 references
1983
0 references
algorithms
0 references
optimal sequence
0 references
sequencing
0 references
setup time
0 references
processing time
0 references
removal time
0 references
completion time
0 references
three machine problem
0 references
decision rules
0 references
optimum solution
0 references
