Improved bounded dynamic programming algorithm for solving the blocking flow shop problem (Q1725819): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1007/s10100-017-0488-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2756095485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the job-shop scheduling problem optimally by dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Numerical Experiments for an <i>M</i> × <i>J</i> Flow Shop and its Decision-Theoretical Aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling with limited temporary storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Flow-Shop Sequencing Problem with No Wait in Process<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flowshop sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to: ``Solving the job-shop scheduling problem optimally by dynamic programming'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:17, 18 July 2024

scientific article
Language Label Description Also known as
English
Improved bounded dynamic programming algorithm for solving the blocking flow shop problem
scientific article

    Statements

    Improved bounded dynamic programming algorithm for solving the blocking flow shop problem (English)
    0 references
    0 references
    15 February 2019
    0 references
    0 references
    scheduling
    0 references
    blocking flow shop
    0 references
    bounded dynamic programming
    0 references
    exact method
    0 references
    0 references