A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem (Q622145): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2010.09.015 / 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: Deterministic job-shop scheduling: Past, present and future / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4238569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition methods for large job shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: A large step random walk for minimizing total weighted tardiness in a job shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted tardiness in a generalized job shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided Local Search with Shifting Bottleneck for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / 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: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measures of subproblem criticality in decomposition algorithms for shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new model for the preemptive earliness-tardiness scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified shifting bottleneck procedure for job-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of shifting bottleneck procedures for shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulating the single machine sequencing problem with release dates as a mixed integer program / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm for the job shop scheduling problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2010.09.015 / rank
 
Normal rank

Latest revision as of 22:31, 9 December 2024

scientific article
Language Label Description Also known as
English
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
scientific article

    Statements

    A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem (English)
    0 references
    0 references
    31 January 2011
    0 references
    job shop
    0 references
    weighted tardiness
    0 references
    shifting bottleneck
    0 references
    tabu search
    0 references
    preemption
    0 references
    transportation problem
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers