Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Cluster analysis to minimize sequence dependent changeover times

From MaRDI portal
Publication:1900258
Jump to:navigation, search

DOI10.1016/0895-7177(95)00083-EzbMath0834.90062OpenAlexW2032582739MaRDI QIDQ1900258

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

manufacturingcluster analysisproduct groupingproduct changeover timesproduct sequencing


Mathematics Subject Classification ID

Production models (90B30)


Related Items (2)

Heuristic approaches for batching jobs in printed circuit board assembly ⋮ A cloud based job sequencing with sequence-dependent setup for sheet metal manufacturing


Uses Software

  • SAS



Cites Work

  • Unnamed Item
  • Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1900258&oldid=14310611"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 13:52.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki