A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking (Q817122): 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/s10479-005-2444-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021347904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Cycle Time in a Blocking Flowshop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage / 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: Sequencing of jobs in some production system / 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: Flowshop sequencing problems with limited buffer storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal planning of part's machining on a number of machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing in an Assembly Line with Blocking to Minimize Cycle Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The permutation flow shop with buffers: A tabu search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling with limited temporary storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—Sequencing with Finite Intermediate 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: Lower bounding schemes for flowshops with blocking in-process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs: Part 1 / 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 10:44, 24 June 2024

scientific article
Language Label Description Also known as
English
A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
scientific article

    Statements

    A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking (English)
    0 references
    0 references
    7 March 2006
    0 references
    flowshop
    0 references
    blocking
    0 references
    makespan
    0 references
    lower bound
    0 references
    branch-and-bound
    0 references

    Identifiers