The complexity of two-job shop problems with multi-purpose unrelated machines. (Q1410331): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Non-Numerical Approach to Production Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the job-shop problem with two jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4396949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-shop scheduling with multi-purpose machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Geometric Model and a Graphical Algorithm for a Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the job-shop scheduling problem on multi-purpose machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of mixed shop scheduling problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of shop-scheduling problems with two or three jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the Akers-Friedman Scheduling Problem / rank
 
Normal rank

Latest revision as of 11:44, 6 June 2024

scientific article
Language Label Description Also known as
English
The complexity of two-job shop problems with multi-purpose unrelated machines.
scientific article

    Statements

    The complexity of two-job shop problems with multi-purpose unrelated machines. (English)
    0 references
    0 references
    0 references
    14 October 2003
    0 references
    0 references
    Shop scheduling
    0 references
    Multi-purpose unrelated machines
    0 references
    Complexity analysis
    0 references