Clarifying cutting and sewing processes with due windows using an effective ant colony optimization (Q460244): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59023386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling with flexible operations and controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with common due windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new encoding scheme-based hybrid algorithm for minimising two-machine flow-shop group scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimising makespan for two batch-processing machines with non-identical job sizes in job shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of mathematical models for flexible job-shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing problem for fashion supply chains with cross-docking / 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 hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Scheduling of a Single-Supplier Single-Manufacturer Supply Chain With Common due Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey Paper—Time Window Constrained Routing and Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4319398 / rank
 
Normal rank

Latest revision as of 03:22, 9 July 2024

scientific article
Language Label Description Also known as
English
Clarifying cutting and sewing processes with due windows using an effective ant colony optimization
scientific article

    Statements

    Clarifying cutting and sewing processes with due windows using an effective ant colony optimization (English)
    0 references
    0 references
    0 references
    13 October 2014
    0 references
    Summary: The cutting and sewing process is a traditional flow shop scheduling problem in the real world. This two-stage flexible flow shop is often commonly associated with manufacturing in the fashion and textiles industry. Many investigations have demonstrated that the ant colony optimization (ACO) algorithm is effective and efficient for solving scheduling problems. This work applies a novel effective ant colony optimization (EACO) algorithm to solve two-stage flexible flow shop scheduling problems and thereby minimize earliness, tardiness, and makespan. Computational results reveal that for both small and large problems, EACO is more effective and robust than both the particle swarm optimization (PSO) algorithm and the ACO algorithm. Importantly, this work demonstrates that EACO can solve complex scheduling problems in an acceptable period of time.
    0 references

    Identifiers