An effective population-based iterated greedy algorithm for solving the multi-AGV scheduling problem with unloading safety detection (Q6179985): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Warehousing in the e-commerce era: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of hybrid metaheuristics for the resource-constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Joint production and transportation scheduling in flexible manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:33, 23 August 2024

scientific article; zbMATH DE number 7791093
Language Label Description Also known as
English
An effective population-based iterated greedy algorithm for solving the multi-AGV scheduling problem with unloading safety detection
scientific article; zbMATH DE number 7791093

    Statements

    An effective population-based iterated greedy algorithm for solving the multi-AGV scheduling problem with unloading safety detection (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 January 2024
    0 references
    automated guided vehicle
    0 references
    iterated greedy algorithm
    0 references
    safety detection
    0 references
    unloading setup time
    0 references
    scheduling
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references