A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements (Q2230732): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-021-00706-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3127761927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling subject to resource constraints: Classification and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation schedules for a two-machine flow shop with storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multigraph realizations of degree sequences: Maximization is easy, minimization is hard / 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: Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow shop with job-dependent buffer requirements -- a polynomial-time algorithm and efficient heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete 4-parametric complexity classification of short shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The variable neighborhood search for the two machine flow shop problem with a passive prefetch / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple heuristics for scheduling with limited intermediate storage / rank
 
Normal rank

Latest revision as of 16:54, 26 July 2024

scientific article
Language Label Description Also known as
English
A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements
scientific article

    Statements

    A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements (English)
    0 references
    0 references
    0 references
    0 references
    28 September 2021
    0 references
    computational complexity
    0 references
    flow shop
    0 references
    buffer
    0 references
    polynomial-time algorithms
    0 references
    resource constrained scheduling
    0 references

    Identifiers