Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping (Q5059417): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q591734
Created claim: Wikidata QID (P12): Q127017627, #quickstatements; #temporary_batch_1724065909584
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: De-ming Lei / 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.1080/0305215x.2019.1674295 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2980432255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling two-stage hybrid flow shop with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order Assignment and Scheduling in a Supply Chain / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient heuristic algorithm for scheduling two-stage hybrid flowshop with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved shuffled frog-leaping algorithm for flexible job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scatter search algorithm for the distributed permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hybrid flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective shuffled frog-leaping algorithm for multi-mode resource-constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic method for two-stage hybrid flow shop with dedicated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total completion time in two-stage hybrid flow shop with dedicated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Auction-based approach for a flexible job-shop scheduling problem with multiple process plans / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127017627 / rank
 
Normal rank

Latest revision as of 12:11, 19 August 2024

scientific article; zbMATH DE number 7637174
Language Label Description Also known as
English
Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping
scientific article; zbMATH DE number 7637174

    Statements

    Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping (English)
    0 references
    0 references
    0 references
    23 December 2022
    0 references
    shuffled frog-leaping algorithm
    0 references
    distributed scheduling
    0 references
    two-stage hybrid flowshop scheduling problem
    0 references
    sequence-dependent setup times
    0 references

    Identifiers