Tabu-search for the multi-mode job-shop problem (Q1384220): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shop scheduling problems with multiprocessor tasks on dedicated processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-shop scheduling with multi-purpose machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for the job-shop scheduling problem with multi-purpose machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4882527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4872477 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:07, 28 May 2024

scientific article
Language Label Description Also known as
English
Tabu-search for the multi-mode job-shop problem
scientific article

    Statements

    Tabu-search for the multi-mode job-shop problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 July 1998
    0 references
    0 references
    multi-mode job-shop
    0 references
    multi-purpose-machine job-shop
    0 references
    multi-processor-tasks job-shop
    0 references
    makespan
    0 references
    tabu-search
    0 references