Two-machine flowshop scheduling problem with coupled-operations (Q2327688): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for UET scheduling problems with exact delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Scheduling Problems with Exact Delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for scheduling identical coupled tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of coupled tasks with unit processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for coupled tasks scheduling – a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of coupled tasks and one-machine no-wait robotic cells / 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: Permutation flowshop scheduling problems with maximal and minimal time lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing <i>n</i> Jobs on Two Machines with Arbitrary Time Lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of coupled-task scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling coupled tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard / rank
 
Normal rank

Revision as of 15:55, 20 July 2024

scientific article
Language Label Description Also known as
English
Two-machine flowshop scheduling problem with coupled-operations
scientific article

    Statements

    Two-machine flowshop scheduling problem with coupled-operations (English)
    0 references
    0 references
    0 references
    0 references
    15 October 2019
    0 references
    flowshop
    0 references
    coupled-operations
    0 references
    complexity
    0 references
    polynomial time algorithms
    0 references

    Identifiers