Group shops scheduling with makespan criterion subject to random release dates and processing times (Q733535): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2009.04.002 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091005900 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2009.04.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091005900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forecasting policies for scheduling a stochastic due date job shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Genetic Algorithm Approach to Solving Stochastic Job-shop Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid method for solving stochastic job shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal makespan scheduling with given bounds of processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with uncertain numerical data for makespan minimisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean flow time minimization with given bounds of processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for job-shop scheduling problems with stochastic precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ant colony optimization algorithm for shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast tabu search algorithm for the group shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the numerical solutions of stochastic optimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3814662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colony optimization theory: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Solving Production-Scheduling Problems / rank
 
Normal rank

Latest revision as of 01:10, 2 July 2024

scientific article
Language Label Description Also known as
English
Group shops scheduling with makespan criterion subject to random release dates and processing times
scientific article

    Statements

    Group shops scheduling with makespan criterion subject to random release dates and processing times (English)
    0 references
    16 October 2009
    0 references
    group shop scheduling problem
    0 references
    random release dates
    0 references
    random processing times
    0 references
    makespan
    0 references
    ant colony algorithm
    0 references
    simulation
    0 references

    Identifiers