An efficient heuristic approach to the scheduling of jobs in a flowshop (Q1194720): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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: Q4658190 / 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: 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: 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: Errata / rank
 
Normal rank

Latest revision as of 13:29, 16 May 2024

scientific article
Language Label Description Also known as
English
An efficient heuristic approach to the scheduling of jobs in a flowshop
scientific article

    Statements

    An efficient heuristic approach to the scheduling of jobs in a flowshop (English)
    0 references
    6 October 1992
    0 references
    heuristic algorithms
    0 references
    flowshop scheduling
    0 references
    total flowtime
    0 references
    near-optimal solutions
    0 references

    Identifiers