Non-bottleneck machines in three-machine flow shops (Q1585915): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / 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: Counterexamples to optimal permutation schedules for certain flow shop problems / 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: A concise survey of efficiently solvable special cases of the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling with dominant machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow-shops with a dominant machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Three-Stage Flow-Shops with Recessive Second Stage / 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: A note on a paper by W. Szwarc / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Heuristic for Three-Machine Flow Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discussion: Sequencing <i>n</i> Jobs on Two Machines with Arbitrary Time Lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean Flow Time Minimization in Reentrant Job Shops with a Hub / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with Series-Parallel Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shop Problems With Two Machines and Time Lags / rank
 
Normal rank
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 special case of the 3 ×n flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical aspects of the 3 × n job-shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Heuristics of Flow-Shop Scheduling / rank
 
Normal rank

Latest revision as of 17:28, 30 May 2024

scientific article
Language Label Description Also known as
English
Non-bottleneck machines in three-machine flow shops
scientific article

    Statements

    Non-bottleneck machines in three-machine flow shops (English)
    0 references
    0 references
    3 January 2001
    0 references
    0 references
    sequencing
    0 references
    makespan
    0 references
    Johnson's algorithm
    0 references
    worst-case analysis
    0 references