Minimizing <i>L</i> <sub>max</sub> for large-scale, job-shop scheduling problems (Q4671351): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job shop scheduling with deadlines / 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: Applying tabu search to the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for shop scheduling problems / 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: Note. Satisfying Due Dates in Large Job Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new results on simulated annealing applied to the job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Taboo Search Algorithm for the Job Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search method guided by shifting bottleneck for the job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Insertion techniques for the heuristic solution of the job shop problem / rank
 
Normal rank

Latest revision as of 10:31, 10 June 2024

scientific article; zbMATH DE number 2161436
Language Label Description Also known as
English
Minimizing <i>L</i> <sub>max</sub> for large-scale, job-shop scheduling problems
scientific article; zbMATH DE number 2161436

    Statements

    Minimizing <i>L</i> <sub>max</sub> for large-scale, job-shop scheduling problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2005
    0 references
    0 references
    0 references