Two-machine interval shop scheduling with time lags (Q892834): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q161974
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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-013-0336-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979469095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the weighted number of tardy jobs on a two-machine flow shop. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval scheduling: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for the operational fixed interval scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / 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: Hard tiling problems with simple tiles / 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: Two-machine open shop scheduling with special transportation times / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Flow-Shop Sequencing Problem with No Wait in Process<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / 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 / cites work
 
Property / cites work: Polynomial-time approximation schemes for scheduling problems with time lags / rank
 
Normal rank

Latest revision as of 02:17, 11 July 2024

scientific article
Language Label Description Also known as
English
Two-machine interval shop scheduling with time lags
scientific article

    Statements

    Two-machine interval shop scheduling with time lags (English)
    0 references
    0 references
    0 references
    12 November 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    interval scheduling
    0 references
    fixed start and end times
    0 references
    two-machine shop
    0 references
    dynamic programming
    0 references
    NP-hardness
    0 references
    0 references