The total completion time open shop scheduling problem with a given sequence of jobs on one machine (Q1603323): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A new lower bound for the open-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The open shop scheduling problem with a given sequence of jobs on one machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling the Open Shop to Minimize Mean Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch \(\&\) bound algorithm for the open-shop problem / 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: Classical and new heuristics for the open-shop problem: A computational evaluation / 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: Q4841579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shop scheduling problems under precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Solving Production-Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0305-0548(01)00028-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045841722 / rank
 
Normal rank

Latest revision as of 11:47, 30 July 2024

scientific article
Language Label Description Also known as
English
The total completion time open shop scheduling problem with a given sequence of jobs on one machine
scientific article

    Statements

    The total completion time open shop scheduling problem with a given sequence of jobs on one machine (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2002
    0 references
    0 references
    0 references