Problem \(F2||C_{\max}\) with forbidden jobs in the first or last position is easy (Q856325): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2006.01.018 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2081153299 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57633916 / 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: The simple \(F2//C \max\) with forbidden tasks in first or last position: a problem more complex that it seems / rank | |||
Normal rank | |||
Latest revision as of 11:20, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Problem \(F2||C_{\max}\) with forbidden jobs in the first or last position is easy |
scientific article |
Statements
Problem \(F2||C_{\max}\) with forbidden jobs in the first or last position is easy (English)
0 references
7 December 2006
0 references
scheduling
0 references
flow shop
0 references
makespan
0 references
