Three is easy, two is hard: Open shop sum-batch scheduling problem refined (Q2466597): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops / 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: Q4821303 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3137912 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3964013 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear Time Algorithms for Knapsack Problems with Bounded Weights / rank | |||
Normal rank |
Latest revision as of 15:17, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Three is easy, two is hard: Open shop sum-batch scheduling problem refined |
scientific article |
Statements
Three is easy, two is hard: Open shop sum-batch scheduling problem refined (English)
0 references
15 January 2008
0 references
scheduling
0 references
open shop
0 references
batching
0 references
polynomial-time algorithm
0 references