A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing (Q309050): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10951-014-0397-6 / rank
Normal rank
 
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.1007/s10951-014-0397-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015294321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling subject to resource constraints: Classification and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10951-014-0397-6 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:59, 9 December 2024

scientific article
Language Label Description Also known as
English
A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing
scientific article

    Statements

    A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing (English)
    0 references
    0 references
    0 references
    0 references
    7 September 2016
    0 references
    scheduling
    0 references
    parallel machines
    0 references
    setups
    0 references
    auxiliary resources
    0 references
    semiconductor manufacturing
    0 references
    memetic algorithm
    0 references

    Identifiers