A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan (Q4632189): 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/978-3-319-39817-4_22 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2482316384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage / 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: Q4658190 / 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: Flowshop and Jobshop Schedules: Complexity and Approximation / 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: Scheduling a two-stage hybrid flow shop with parallel machines at the first stage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of flow shop scheduling / 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: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in hybrid flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hybrid flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem / 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 01:26, 19 July 2024

scientific article; zbMATH DE number 7048089
Language Label Description Also known as
English
A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan
scientific article; zbMATH DE number 7048089

    Statements

    A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2019
    0 references
    multiprocessor scheduling
    0 references
    flow-shop scheduling
    0 references
    makespan
    0 references
    linear program
    0 references
    polynomial-time approximation scheme
    0 references

    Identifiers