Cluster analysis to minimize sequence dependent changeover times

DOI10.1016/0895-7177(95)00083-EMaRDI QIDQ1900258zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 26 November 1995

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0895-7177(95)00083-e

zbMATH Keywords

cluster analysismanufacturingproduct groupingproduct changeover timesproduct sequencing

Mathematics Subject Classification ID

Production models (90B30)

Recommendations

• CASE: A clustering algorithm for cell formation with sequence data
• The changeover scheduling problem with time and cost considerations: Analytical results and a forward algorithm
• Scheduling a flowline manufacturing cell with sequence dependent family setup times
• Clustered flow shop models
• On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times

Cites work

• scientific article; zbMATH DE number 3469876 (Why is no real title available?)
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem

Cited in

(3)

• Grouping products for the optimization of production processes: a case in the steel manufacturing industry
• A cloud based job sequencing with sequence-dependent setup for sheet metal manufacturing
• Heuristic approaches for batching jobs in printed circuit board assembly

Describes a project that uses

Uses Software

• SAS

This page was built for publication: Cluster analysis to minimize sequence dependent changeover times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900258)