Solving the open shop scheduling problem (Q5939272): 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.1002/jos.73 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2164950451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4380372 / 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: A Computational Study of the Job-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustment of heads and tails for the job-shop problem / 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: The generalized shifting bottleneck procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Insertion techniques for the heuristic solution of the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative improvement approach for the nonpreemptive open shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive genetic algorithms for the open-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint propagation techniques for the disjunctive scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The job-shop problem and immediate selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint propagation in flexible manufacturing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for the open-shop problem / rank
 
Normal rank

Latest revision as of 18:54, 3 June 2024

scientific article; zbMATH DE number 1625460
Language Label Description Also known as
English
Solving the open shop scheduling problem
scientific article; zbMATH DE number 1625460

    Statements

    Solving the open shop scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 August 2001
    0 references
    0 references
    constraint propagation
    0 references
    branch-and-bound
    0 references
    0 references