A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times (Q1919357): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / 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: Constructive heuristic algorithms for the open 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: A branch and bound algorithm for the job-shop 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: A practical use of Jackson's preemptive schedule for solving the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4867834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Scheduling with Batch Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3311639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for permutation flow shop scheduling with batch setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:54, 24 May 2024

scientific article
Language Label Description Also known as
English
A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
scientific article

    Statements

    A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times (English)
    0 references
    0 references
    0 references
    0 references
    5 August 1996
    0 references
    sequence dependent setup-times
    0 references
    disjunctive graph model
    0 references
    precedence relations
    0 references
    job-shop problem
    0 references
    open-shop problem
    0 references

    Identifiers