Complexity results for flow shop problems with synchronous movement (Q726218): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
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.1016/j.ejor.2014.09.053 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090781654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling with dominant machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assembly line balancing in a mixed-model sequencing environment with synchronous transfers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems / 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: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new results in flow shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow shop-sequencing problem with synchronous transfers and makespan minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: No-wait or no-idle permutation flowshop scheduling with dominating machines / rank
 
Normal rank

Latest revision as of 07:40, 12 July 2024

scientific article
Language Label Description Also known as
English
Complexity results for flow shop problems with synchronous movement
scientific article

    Statements

    Complexity results for flow shop problems with synchronous movement (English)
    0 references
    0 references
    0 references
    8 July 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    flow shop
    0 references
    synchronous movement
    0 references
    complexity
    0 references
    dominating machines
    0 references
    0 references