On the open-shop problem with preemption and minimizing the average completion time (Q703917): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution region for certain scheduling problems with preemption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive heuristic algorithms for the open shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Mean Flow Time in Two-Machine Open Shops and Flow 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: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of preemptive open-shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling ordered open shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank

Latest revision as of 17:17, 7 June 2024

scientific article
Language Label Description Also known as
English
On the open-shop problem with preemption and minimizing the average completion time
scientific article

    Statements