FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors (Q4718639): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02522667.1995.10699233 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089278409 / 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 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 Two-Stage Flowshop Scheduling Problem with M Machines at each Stage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptable Scheduling Algorithm for Flexible Flow Lines / rank
 
Normal rank

Latest revision as of 15:08, 24 May 2024

scientific article; zbMATH DE number 954588
Language Label Description Also known as
English
FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors
scientific article; zbMATH DE number 954588

    Statements

    Identifiers