A genetic algorithm-based approach to machine assignment problem (Q5466733): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q126250566, #quickstatements; #temporary_batch_1721913393134
 
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/00207540500045956 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968788080 / 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: A review of manufacturing flexibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolution based learning in a job shop scheduling environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: CASE: A clustering algorithm for cell formation with sequence data / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126250566 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:35, 25 July 2024

scientific article; zbMATH DE number 2198741
Language Label Description Also known as
English
A genetic algorithm-based approach to machine assignment problem
scientific article; zbMATH DE number 2198741

    Statements

    A genetic algorithm-based approach to machine assignment problem (English)
    0 references
    25 August 2005
    0 references
    0 references
    machining flexibility
    0 references
    machine assignment
    0 references
    job-shop scheduling
    0 references
    genetic algorithms
    0 references
    0 references
    0 references