A new constructive heuristic for the flowshop scheduling problem (Q1291704): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Technical Note—Johnson's Three-Machine Flow-Shop Conjecture / rank
 
Normal rank
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: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop and Jobshop Schedules: Complexity and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Heuristic Algorithm for the Flowshop Scheduling Problem / 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: A Note on Heuristics of Flow-Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sevast'yanov's algorithm for the flow-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of an approximation algorithm for flow-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results in the worst-case analysis for flow-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on worst-case analysis of approximation algorithms for a scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast tabu search algorithm for the permutation flow-shop problem / 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: A survey and evaluation of static flowshop scheduling heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation vs. non-permutation flow shop schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops / 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 20:33, 28 May 2024

scientific article
Language Label Description Also known as
English
A new constructive heuristic for the flowshop scheduling problem
scientific article

    Statements

    A new constructive heuristic for the flowshop scheduling problem (English)
    0 references
    22 March 2001
    0 references
    0 references
    scheduling theory
    0 references
    flowshop
    0 references
    makespan
    0 references
    heuristic
    0 references