A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations (Q1991311): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Evaluation of mathematical models for flexible job-shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-stage assembly scheduling problem to minimize total completion time with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook on Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of flexible flow line scheduling procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hybrid flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid flowshop scheduling with machine and resource-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow-shop scheduling with setup and assembly operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Stage Assembly Scheduling Problem: Complexity and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the two-stage assembly scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and bound algorithm for the flow shop with multiple processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach / rank
 
Normal rank

Revision as of 04:02, 17 July 2024

scientific article
Language Label Description Also known as
English
A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations
scientific article

    Statements

    A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations (English)
    0 references
    30 October 2018
    0 references
    scheduling
    0 references
    hybrid flow shop
    0 references
    assembly
    0 references
    branch and bound
    0 references
    setup time
    0 references
    0 references
    0 references

    Identifiers