Skip to content
Smart Scholars🛡 Scholar Shield🏛 Research Integrity Desk🧩 Portfolio Console📰 Journals🔧 DOI MembersTools🔎 Journal AuditGI GetIndexedDr DOI Doctor

Cite this DOI

10.46243/jst.2021.v6.i05.pp82-88 · Solving Generalized groupings problems in Cellular manufacturing systems by genetic algorithms

APA (7th edition)

Dr. Prafulla, & C. Kulkarni (2021). Solving Generalized groupings problems in Cellular manufacturing systems by genetic algorithms. *Journal of Science & Technology*, *06*(05), 82–88. https://doi.org/10.46243/jst.2021.v6.i05.pp82-88

⬇ text Italics are shown as *asterisks* in plain text — the journal or book title and the volume.

BibTeX

@article{drprafulla2021solving,
  author    = {Dr. Prafulla and C. Kulkarni},
  title     = {{Solving Generalized groupings problems in Cellular manufacturing systems by genetic algorithms}},
  journal   = {Journal of Science \& Technology},
  year      = {2021},
  month     = {oct},
  volume    = {06},
  number    = {05},
  pages     = {82--88},
  publisher = {Longman Publishers},
  issn      = {2456-5660},
  doi       = {10.46243/jst.2021.v6.i05.pp82-88},
  url       = {https://doi.org/10.46243/jst.2021.v6.i05.pp82-88},
  language  = {en},
  abstract  = {Cell formation problem consists of identifying machine groups and part families. Generalized grouping problem have more than one process plans and or process routes. In non-heierarchical methods all decisions are made simultaneously and in heierchical methods decisions are made in stages. Because of complexity of the generalized problem, solving large size problems using simultaneous approach becomes difficult. The grouping problem assumes a particular structure depending on the objectives and the constraints. The mathematical models of generalized grouping are found to be either NP-complete or hard to solve. Since even the relaxed version of grouping problem is NP-complete, it is unlikely that the optimal solution to the problem can be found efficiently. Genetic Algorithm is largely used for solving problems in cellular manufacturing. In this paper, a model is developed to solve the generalized grouping problem considering alternative process plans. Several design and manufacturing parameters such as production volume, process sequence, machine capacity, processing time, machine duplication, number of cells and cell size are considered. The objective function minimizes intercellular movements and number of exceptional elements. A procedure based on genetic algorithms to solve the problem in two phases has been demonstrated. In the first phase it finds the process routes and in the next it forms grouping of machines. The algorithm coded in C++ was tested on Windows workstation. The objective to form cells and part families was based on a double grouping (operations and machines). The final solution is a proposition of machine cells defining part families. The algorithm is really fast and allows trying different configurations for the set of data and different alternatives of the weights for all criteria. It can be useful in solving large size grouping problems.}
}

⬇ .bib

RIS (EndNote, Zotero, Mendeley)

TY  - JOUR
TI  - Solving Generalized groupings problems in Cellular manufacturing systems by genetic algorithms
AU  - Dr. Prafulla
AU  - C. Kulkarni
JO  - Journal of Science & Technology
PY  - 2021
DA  - 2021/10/21/
VL  - 06
IS  - 05
SP  - 82
EP  - 88
PB  - Longman Publishers
SN  - 2456-5660
LA  - en
AB  - Cell formation problem consists of identifying machine groups and part families. Generalized grouping problem have more than one process plans and or process routes. In non-heierarchical methods all decisions are made simultaneously and in heierchical methods decisions are made in stages. Because of complexity of the generalized problem, solving large size problems using simultaneous approach becomes difficult. The grouping problem assumes a particular structure depending on the objectives and the constraints. The mathematical models of generalized grouping are found to be either NP-complete or hard to solve. Since even the relaxed version of grouping problem is NP-complete, it is unlikely that the optimal solution to the problem can be found efficiently. Genetic Algorithm is largely used for solving problems in cellular manufacturing. In this paper, a model is developed to solve the generalized grouping problem considering alternative process plans. Several design and manufacturing parameters such as production volume, process sequence, machine capacity, processing time, machine duplication, number of cells and cell size are considered. The objective function minimizes intercellular movements and number of exceptional elements. A procedure based on genetic algorithms to solve the problem in two phases has been demonstrated. In the first phase it finds the process routes and in the next it forms grouping of machines. The algorithm coded in C++ was tested on Windows workstation. The objective to form cells and part families was based on a double grouping (operations and machines). The final solution is a proposition of machine cells defining part families. The algorithm is really fast and allows trying different configurations for the set of data and different alternatives of the weights for all criteria. It can be useful in solving large size grouping problems.
DO  - 10.46243/jst.2021.v6.i05.pp82-88
UR  - https://doi.org/10.46243/jst.2021.v6.i05.pp82-88
ER  -

⬇ .ris

CSL-JSON

{
    "type": "article-journal",
    "id": "10.46243/jst.2021.v6.i05.pp82-88",
    "DOI": "10.46243/jst.2021.v6.i05.pp82-88",
    "URL": "https://doi.org/10.46243/jst.2021.v6.i05.pp82-88",
    "title": "Solving Generalized groupings problems in Cellular manufacturing systems by genetic algorithms",
    "source": "Smart Scholars Registry",
    "container-title": "Journal of Science & Technology",
    "author": [
        {
            "family": "Dr. Prafulla"
        },
        {
            "family": "C. Kulkarni"
        }
    ],
    "issued": {
        "date-parts": [
            [
                2021,
                10,
                21
            ]
        ]
    },
    "volume": "06",
    "issue": "05",
    "page": "82-88",
    "publisher": "Longman Publishers",
    "language": "en",
    "abstract": "Cell formation problem consists of identifying machine groups and part families. Generalized grouping problem have more than one process plans and or process routes. In non-heierarchical methods all decisions are made simultaneously and in heierchical methods decisions are made in stages. Because of complexity of the generalized problem, solving large size problems using simultaneous approach becomes difficult. The grouping problem assumes a particular structure depending on the objectives and the constraints. The mathematical models of generalized grouping are found to be either NP-complete or hard to solve. Since even the relaxed version of grouping problem is NP-complete, it is unlikely that the optimal solution to the problem can be found efficiently. Genetic Algorithm is largely used for solving problems in cellular manufacturing. In this paper, a model is developed to solve the generalized grouping problem considering alternative process plans. Several design and manufacturing parameters such as production volume, process sequence, machine capacity, processing time, machine duplication, number of cells and cell size are considered. The objective function minimizes intercellular movements and number of exceptional elements. A procedure based on genetic algorithms to solve the problem in two phases has been demonstrated. In the first phase it finds the process routes and in the next it forms grouping of machines. The algorithm coded in C++ was tested on Windows workstation. The objective to form cells and part families was based on a double grouping (operations and machines). The final solution is a proposition of machine cells defining part families. The algorithm is really fast and allows trying different configurations for the set of data and different alternatives of the weights for all criteria. It can be useful in solving large size grouping problems.",
    "ISSN": "2456-5660"
}

⬇ .json What citeproc and reference managers read; the DOI system hands it out for Accept: application/vnd.citationstyles.csl+json, and so does this registry's resolver.

From the record as registered (version 2) — the record and its history. Programs: https://registry.smartscholars.in/api.php?action=cite&doi=10.46243%2Fjst.2021.v6.i05.pp82-88 gives all four in one JSON answer.

Share this page

Share this page

Ask AI about this page

Everything Smart Scholars runs

Nine sites, one account. A journal starts at the audit; an author starts at Scholar Shield.

What we do: DOIs registered from what a journal already has · Crossref records completed — references, abstracts, licences, ORCID iDs, affiliations and ROR IDs, funding · DOIs that resolve · articles preserved · journals rated on the public record · see everything we do →

Book a free call

For journals & publishers

Start with the audit — ₹4,999 per journal, and the gate to everything else.

DOI care

Every service on one journal profile — each previews first and acts only on your approval.

  • DOI Doctor — check & repairevery DOI tested at doi.org and Crossref; dead links, abstracts, licences, ORCIDs
  • Smart Deposita new DOI from your PDF, Word file, article page, JATS XML or spreadsheet — every value shown with its source, deposited once you confirm it
  • DOI census (Excel)site against Crossref, both directions, with a copy-paste fix per article
  • Backfile DOIsDOIs for older articles that never had one — no per-DOI fee of ours
  • DOIs for conference proceedingsthe conference, the volume and every paper — registered in the organiser's own name
  • Scopus indexing guidethe minimum criteria, the 14 CSAB criteria and how a title is suggested — from Elsevier's own page
  • Embase indexing guidewhat Embase asks of a biomedical journal and how to suggest it
  • Write DOIs into OJSthe verified DOIs pushed onto your article pages through your own API
  • Silent-failure monitorweekly checks of site, OAI-PMH, Scholar tags, ISSN, preservation, hijack lists
  • Journal Radarevery journal, every day: SSL, DNS, redirects, robots.txt, OJS, DOIs, Crossref metadata, broken links — what broke since yesterday first
  • Verified metrics & badgesa public, dated, source-linked metrics page and a "cited by" badge
  • Quality dossier (PDF)one PDF for universities, authors and reviewers
  • Author citation enginethe citation steps emailed to each author from the journal's own mailbox
  • JATS XMLmachine-readable JATS per article
  • Duplicate articlesthe same paper published twice — you choose which copy stays

For authors & researchers

Free to use. Nothing you check is shared with the journal.

For institutions, sponsors & DOI operators

Smart Scholars

Mon–Sat, 10:00–19:00 IST. The Ask AI button on every page answers about our services at any hour.

News

Policies

What we can register a DOI for

20 kinds of record, one account, one place. Every one gets a DOI that resolves, metadata that indexes read, and a record that stays correct afterwards.

Journals

  • Journal articles
  • Journal titles
  • Pending publications
  • Peer reviews
  • Preprints & posted content

Books & conferences

  • Books
  • Book chapters
  • Book series
  • Book sets
  • Conference proceedings
  • Proceedings series
  • Conference papers

Other research output

  • Theses & dissertations
  • Reports & working papers
  • Report series
  • Standards
  • Databases
  • Datasets
  • Figures, tables & supplements

Funding

  • Grants & funding awards

Elsewhere

The same company, in the places our publishers already read.
Add Smart Scholars as a preferred source on GoogleSee more of our newsroom in Google’s Top Stories.
Smart Scholars · Every service on one pageNewsroom posts CC BY 4.0 · DOI metadata CC0 · everything else ©Data from OpenAlex (openalex.org), CC0 · Crossref · ISSN Portal · DOAJContact
WhatsApp