Polynomial-time approximation schemes for scheduling problems with time lags (Q600835): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10951-009-0134-8 / rank
Normal rank
 
Property / author
 
Property / author: Q583098 / rank
Normal rank
 
Property / author
 
Property / author: Steef L. van de Velde / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-009-0134-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966192374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling the Open Shop to Minimize Mean Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for flow-shop and open-shop scheduling problems with transportation delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Scheduling with Pipelined Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shop Problems With Two Machines and Time Lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / 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: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem / 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: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing <i>n</i> Jobs on Two Machines with Arbitrary Time Lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for a coupled-operation scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shop scheduling with delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine open shop scheduling with special transportation times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the two-machine open-shop scheduling problem with transportation times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4884350 / 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
Property / DOI
 
Property / DOI: 10.1007/S10951-009-0134-8 / rank
 
Normal rank

Latest revision as of 21:55, 9 December 2024

scientific article
Language Label Description Also known as
English
Polynomial-time approximation schemes for scheduling problems with time lags
scientific article

    Statements

    Polynomial-time approximation schemes for scheduling problems with time lags (English)
    0 references
    0 references
    0 references
    3 November 2010
    0 references
    machine scheduling
    0 references
    time lags
    0 references
    approximability
    0 references
    polynomial-time approximation scheme (PTAS)
    0 references
    0 references

    Identifiers