On no-wait and no-idle flow shops with makespan criterion (Q859679): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Minimizing Cycle Time in a Blocking Flowshop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: No-wait flowshops with bicriteria of makespan and maximum lateness. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs) / 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: Some local search algorithms for no-wait flow-shop problem with makespan criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process / 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: A concise survey of efficiently solvable special cases of the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Flow-Shop Sequencing Problem with No Wait in Process<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Three-Machine No-Wait Flow Shop is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Two-Machine Orderings in the 3 × <i>n</i> Flow-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple algorithms for gilmore-gomory's traveling salesman and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the Flowshop-Scheduling Problem with No Intermediate Queues / rank
 
Normal rank

Revision as of 11:40, 25 June 2024

scientific article
Language Label Description Also known as
English
On no-wait and no-idle flow shops with makespan criterion
scientific article

    Statements

    On no-wait and no-idle flow shops with makespan criterion (English)
    0 references
    0 references
    0 references
    16 January 2007
    0 references
    scheduling
    0 references
    flow shops
    0 references
    makespan
    0 references
    no-wait condition
    0 references
    no-idle condition
    0 references

    Identifiers