Solving coupled task assignment and capacity planning problems for a job shop by using a concurrent genetic algorithm (Q3168941): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207540903490163 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056826223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic task assignment for throughput maximization with worksharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust capacity planning in semiconductor manufacturing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of open queueing network models of manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity planning in manufacturing networks with discrete options / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of manufacturing systems using queueing models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational algorithms for closed queueing networks with exponential servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tool capacity planning in semiconductor manufacturing. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint logic programming and integer programming approaches and their collaboration in solving an assignment scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance evaluation and capacity planning in a metallurgical job-shop system using open queueing network models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic programming based capacity planning for semiconductor wafer fab with uncertain demand and capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for capacity planning problems with congestion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved mathematical program to solve the simple assembly line balancing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tool capacity planning for semiconductor fabrication facilities under demand uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-stage simulation optimization for agile manufacturing capacity planning / rank
 
Normal rank

Latest revision as of 00:34, 4 July 2024

scientific article
Language Label Description Also known as
English
Solving coupled task assignment and capacity planning problems for a job shop by using a concurrent genetic algorithm
scientific article

    Statements

    Solving coupled task assignment and capacity planning problems for a job shop by using a concurrent genetic algorithm (English)
    0 references
    0 references
    0 references
    27 April 2011
    0 references
    0 references
    job shop
    0 references
    task assignment
    0 references
    capacity planning
    0 references
    closed Jackson queueing networks
    0 references
    coupled optimisation problems
    0 references
    concurrent genetic algorithm
    0 references
    0 references