A flexible flowshop problem with total flow time minimization (Q5939584): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop / 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: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Textile Production Systems: a Succession of Non-identical Parallel Processor Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Stage, Hybrid Flowshop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a two-stage hybrid flowshop with separable setup and removal times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic for the n-job, M-machine flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3212909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient heuristic approach to the scheduling of jobs in a flowshop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-stage parallel-processor flowshop problem with minimum flowtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling algorithms for flexible flowshops: Worst and average case performance / rank
 
Normal rank

Latest revision as of 18:59, 3 June 2024

scientific article; zbMATH DE number 1626203
Language Label Description Also known as
English
A flexible flowshop problem with total flow time minimization
scientific article; zbMATH DE number 1626203

    Statements

    A flexible flowshop problem with total flow time minimization (English)
    0 references
    0 references
    0 references
    0 references
    30 November 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel machines
    0 references
    total flow time
    0 references
    flexible flowshop environment
    0 references
    branch and bound algorithm
    0 references
    optimal schedule
    0 references
    efficiency
    0 references
    dominance criterion
    0 references