A branch \(\&\) bound algorithm for the open-shop problem (Q1363739): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(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: Constructive heuristic algorithms for the open shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shop problems with unit time operations / 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: The one-machine sequencing 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: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Machine Open Shops with Renewable Resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note On The Complexity Of Openshop Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809220 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015241450 / rank
 
Normal rank

Latest revision as of 09:53, 30 July 2024

scientific article
Language Label Description Also known as
English
A branch \(\&\) bound algorithm for the open-shop problem
scientific article

    Statements

    Identifiers