Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem (Q872264): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
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.1016/j.ejor.2006.05.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2133204269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single-machine absolute-deviation early-tardy problem with random completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with Earliness and Tardiness Penalties: A Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the expected weighted number of tardy jobs in stochastic flow shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with exponential processing times and general stochastic cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with earliness, tardiness and non-execution penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inference for the crossing point of two continuous cdf's / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic scheduling of stochastic jobs on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling to minimize the number of early and tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Single Machine Early/Tardy Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for minimizing weighted earliness penalty in single-machine problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Scheduling with Release Dates and Due Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing jobs on a single machine with a common due data and stochastic processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stochastic single machine scheduling problem with earliness and tardiness costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness-tardiness scheduling with setup considerations / rank
 
Normal rank

Revision as of 15:36, 25 June 2024

scientific article
Language Label Description Also known as
English
Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
scientific article

    Statements

    Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem (English)
    0 references
    27 March 2007
    0 references
    scheduling
    0 references
    stochastic
    0 references
    single machine
    0 references
    early and tardy jobs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers