Flowshop sequencing problems with limited buffer storage (Q3489782): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
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: Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage / 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: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman 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: New directions in scheduling theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling with limited temporary storage / 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: An adaptive branching rule for the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—Sequencing with Finite Intermediate Storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Flow-Shop Sequencing Problem with No Wait in Process<sup>†</sup> / rank
 
Normal rank

Latest revision as of 10:03, 21 June 2024

scientific article
Language Label Description Also known as
English
Flowshop sequencing problems with limited buffer storage
scientific article

    Statements

    Identifiers