Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays (Q5505680): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximation Algorithms for Scheduling Problems with Exact 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: Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the continuous flow-shop scheduling problem by metaheuristics. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit Execution Time Shop Problems / 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: Optimal flowshop schedules with no intermediate storage space / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling with limited temporary storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for continuous flow-shop problem / 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: Some no-wait shops scheduling problems: Complexity aspect / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the flow-shop problem without interruptions in job processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solvable Cases of the No-wait Flow-shop Scheduling Problem / 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

Latest revision as of 23:54, 28 June 2024

scientific article; zbMATH DE number 5498477
Language Label Description Also known as
English
Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays
scientific article; zbMATH DE number 5498477

    Statements

    Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays (English)
    0 references
    0 references
    0 references
    0 references
    27 January 2009
    0 references

    Identifiers