Approximation algorithms for two-machine flow shop scheduling with batch setup times (Q1290646): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the Complexity of Scheduling with Batch Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity / 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: Two-machine shop scheduling problems with batch processing / 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: Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times / rank
 
Normal rank

Revision as of 19:25, 28 May 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for two-machine flow shop scheduling with batch setup times
scientific article

    Statements

    Approximation algorithms for two-machine flow shop scheduling with batch setup times (English)
    0 references
    0 references
    0 references
    0 references
    3 June 1999
    0 references
    approximation algorithm
    0 references
    independent jobs
    0 references
    two-machine flow shop
    0 references
    makespan
    0 references
    batch setup time
    0 references
    NP-hard
    0 references
    heuristic algorithms
    0 references
    worst-case performance
    0 references

    Identifiers