Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates (Q1044134): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Éric Pinson / rank
Normal rank
 
Property / author
 
Property / author: David Rivreau / rank
Normal rank
 
Property / author
 
Property / author: Éric Pinson / rank
 
Normal rank
Property / author
 
Property / author: David Rivreau / 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.1016/j.ejor.2009.02.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4298056606 / 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: Preemption in single machine earliness/tardiness scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordonnancements à contraintes disjonctives / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical use of Jackson's preemptive schedule for solving the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustment of heads and tails for the job-shop problem / 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: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved earliness--tardiness timing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the earliness--tardiness costs on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to computing optimal schedules for the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using short-term memory to minimize the weighted number of late jobs on a single machine. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine problem with earliness and tardiness penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling / rank
 
Normal rank

Latest revision as of 06:29, 2 July 2024

scientific article
Language Label Description Also known as
English
Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates
scientific article

    Statements

    Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates (English)
    0 references
    0 references
    0 references
    0 references
    10 December 2009
    0 references
    scheduling
    0 references
    just-in-time
    0 references
    elimination rules
    0 references
    Lagrangian relaxation
    0 references
    exact method
    0 references
    0 references
    0 references

    Identifiers