Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs (Q1293204): 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: Rafal Rózycki / rank
Normal rank
 
Property / author
 
Property / author: Jan Weglarz / rank
Normal rank
 
Property / author
 
Property / author: Rafal Rózycki / rank
 
Normal rank
Property / author
 
Property / author: Jan Weglarz / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Genocop / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tabu search metaheuristic: How we used it / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search metaheuristics for discrete-continuous scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a methodology for discrete-continuous scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved tabu search approach for solving the job shop scheduling problem with tooling constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785827 / rank
 
Normal rank

Latest revision as of 21:01, 28 May 2024

scientific article
Language Label Description Also known as
English
Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
scientific article

    Statements

    Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 June 1999
    0 references
    0 references
    discrete-continuous scheduling problems
    0 references
    metaheuristics simulated anneling
    0 references