An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs (Q1280126): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evaluation of Flow Shop Sequencing Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938812 / 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: A user's guide to tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop sequencing with mean flowtime objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified simulated annealing algorithms for the flow shop sequencing 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: AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING / rank
 
Normal rank
Property / cites work
 
Property / cites work: The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient heuristic methods for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic method for the flow shop sequencing problem / rank
 
Normal rank

Latest revision as of 17:52, 28 May 2024

scientific article
Language Label Description Also known as
English
An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
scientific article

    Statements

    An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs (English)
    0 references
    0 references
    10 March 1999
    0 references
    flowshop
    0 references
    total weighted flowtime of jobs
    0 references
    heuristic
    0 references
    lower bounds
    0 references

    Identifiers