The permutation flow shop with buffers: A tabu search approach (Q1610144): 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 Survey of Machine Scheduling Problems with Blocking and No-Wait in Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop sequencing problems with limited buffer storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-machine permutation flow shop scheduling problem with buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two-machine scheduling with release and due dates to minimize maximum lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness / 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: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Taboo Search Algorithm for the Job Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank

Revision as of 14:03, 4 June 2024

scientific article
Language Label Description Also known as
English
The permutation flow shop with buffers: A tabu search approach
scientific article

    Statements

    Identifiers