Complexity of mixed shop scheduling problems: A survey (Q1969835): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Non-Numerical Approach to Production Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling the Open Shop to Minimize Mean Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3763890 / 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: A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4859840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive job-shop scheduling problems with a fixed number of jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of two machine job-shop scheduling with regular objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop and Jobshop Schedules: Complexity and Approximation / 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: A Geometric Model and a Graphical Algorithm for a Sequencing Problem / 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: Q4882997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Maximum Lateness in a Two-Machine Open Shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixed shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling two jobs with fixed and nonfixed routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shop-scheduling problems with fixed and non-fixed machine orders of the jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function / 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: Q4836308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of shop-scheduling problems with three jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Machine Super-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shop scheduling problems under precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the Akers-Friedman Scheduling Problem / rank
 
Normal rank

Latest revision as of 14:32, 29 May 2024

scientific article
Language Label Description Also known as
English
Complexity of mixed shop scheduling problems: A survey
scientific article

    Statements

    Complexity of mixed shop scheduling problems: A survey (English)
    0 references
    0 references
    0 references
    0 references
    19 March 2000
    0 references
    0 references
    0 references
    0 references
    0 references
    optimal scheduling
    0 references
    mixture of job and open shops
    0 references
    polynomial algorithm
    0 references
    NP-hard problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references