Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem (Q2491772): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A survey of very large-scale neighborhood search techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: PERT scheduling with convex cost functions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4695783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem / 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: Optimal timing of a sequence of tasks with general completion costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4859570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties / rank
 
Normal rank

Latest revision as of 16:27, 24 June 2024

scientific article
Language Label Description Also known as
English
Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
scientific article

    Statements

    Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem (English)
    0 references
    0 references
    0 references
    29 May 2006
    0 references
    0 references
    scheduling
    0 references
    single machine
    0 references
    earliness-tardiness cost
    0 references
    neighborhoods
    0 references
    search method
    0 references
    0 references