Flexible flow shop scheduling with uniform parallel machines (Q2569085): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Kyparisis, George J. / rank
Normal rank
 
Property / author
 
Property / author: Christos P. Koulamas / rank
Normal rank
 
Property / author
 
Property / author: Kyparisis, George J. / rank
 
Normal rank
Property / author
 
Property / author: Christos P. Koulamas / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2004.05.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039771670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees / 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: Q4840097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for List Schedules on Uniform Processors / 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: Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling on uniform parallel machines to minimize maximum lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4487091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assembly-Line Scheduling with Concurrent Operations and Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Heuristics of Flow-Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in hybrid flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Stage Assembly Scheduling Problem: Complexity and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3312008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding algorithm for the routing problem with arbitrary paths and alternative servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some geometric methods in scheduling theory: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Shop Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines / rank
 
Normal rank

Latest revision as of 17:36, 10 June 2024

scientific article
Language Label Description Also known as
English
Flexible flow shop scheduling with uniform parallel machines
scientific article

    Statements

    Flexible flow shop scheduling with uniform parallel machines (English)
    0 references
    17 October 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling
    0 references
    makespan
    0 references
    flexible flow shop
    0 references
    uniform machines
    0 references
    absolute performance guarantee
    0 references
    approximation algorithms
    0 references
    0 references