Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments (Q2215191): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-019-00633-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3000464179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Heuristic for Three-Machine Flow Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for the parallel two-stage flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Stage, Hybrid Flowshop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501555 / 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: The hybrid flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization in open shops: A polynomial time approximation scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Shop Schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the parallel flow shop problem / rank
 
Normal rank

Latest revision as of 05:02, 24 July 2024

scientific article
Language Label Description Also known as
English
Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments
scientific article

    Statements

    Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 December 2020
    0 references
    scheduling
    0 references
    extended two-stage open shop
    0 references
    two-machine flow shop
    0 references
    multiprocessor
    0 references
    approximation algorithm
    0 references

    Identifiers