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

10.46243/jst.2021.v6.i05.pp82-88 registered

Solving Generalized groupings problems in Cellular manufacturing systems by genetic algorithms

Resolves to https://www.jst.org.in/index.php/pub/article/view/935

Held by Longman Publishers (India) · prefix 10.46243 live · DOI address https://doi.org/10.46243/jst.2021.v6.i05.pp82-88

Registered 29 Sep 2026 via crossref · record version 2 · last change 30 Sep 2026, 12:00 AM · record sha256 9e23417188a79030…

Resolve ⬇ Record (JSON) ⬇ Kernel Metadata Declaration (XML) Compare with Crossref Cite (APA · BibTeX · RIS · CSL)

Also as schema.org JSON-LD · Turtle · RDF/XML · DataCite XML · Crossref UNIXREF · Crossref UNIXSD — the formats of the DOI content-negotiation service, from this record (which carries what).

What the DOI identifies

JournalArticle — an article in a journal · Digital · Visual · en

Solving Generalized groupings problems in Cellular manufacturing systems by genetic algorithms (PrincipalTitle · en)

Published 2021-10-21

Part of Journal of Science & Technology · ISSN 2456-5660 · volume 06 · issue 05 · pages 82–88

Agents

  • Dr. Prafulla (author)
  • C. Kulkarni (author)
  • Longman Publishers (publisher)

Identifiers DOI 10.46243/jst.2021.v6.i05.pp82-88

Abstract · en

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.

Licence https://creativecommons.org/licenses/by/4.0/

System metadata — ISO 26324:2025, Annex B · DOI Handbook 10.1

Each element by the standard's name (Annex B: reference elements, then administrative) and the Handbook's (in grey), read off the record above.

ElementValueIn the record
DOI Name
DOI name
10.46243/jst.2021.v6.i05.pp82-88doi
Referent Type
referentType
Creationreferent
Referent Sub-Type
referentSubType
JournalArticle — an article in a journaltype
Referent Name(s)
referentName(s)
Solving Generalized groupings problems in Cellular manufacturing systems by genetic algorithms (PrincipalTitle, en)titles
Basic Metadata
basicMetadata
author: Dr. Prafulla
author: C. Kulkarni
publisher: Longman Publishers
published: 2021-10-21
part of: Journal of Science & Technology · ISSN 2456-5660 · vol. 06 · no. 05 · pp. 82–88
language: en
form: Digital · Visual · Language
agents, dates, container, language, structural_type, modes, characters
Referent Identifier(s)
alternateIdentifier(s)
none besides the DOIidentifiers, relations (IsSameAs)
Registration Authority
registrationAuthorityCode
Crossref — issued by Crossref (member 25296); held here as a copyrecord.source_agency (our code, ra_doi_name, for names issued here once appointed)
Created Date
issueDate
2026-09-12record.registered (when the DOI name was first registered)
relatedIdentifiersnone needed — the descriptive metadata is in this recordcontainer, relations (only where the descriptive metadata lives at another identifier)

complete Every System Metadata element is here, with the basic metadata a journal article needs.

The System Metadata Declaration (JSON) · the Kernel Metadata Declaration (XML) · what each sub-type needs

Cited by — in this registry

No record held in this registry cites this DOI.

Counts only records held in this registry; a citation from a work held elsewhere is not seen here. The list as JSON

References with DOIs

The record lists 17 references; 17 carry a DOI.

#ReferenceDOIHeld here
1ref1 Kusiak A., The generalized group technology concept, International Journal of Production Research, 1987, 26(5), 887-90410.1080/00207548808947908not held here
2ref2 Singh N., Design of cellular manufacturing systems: An invited review, European Journal of Operational Research, 1993, 69, 284-29110.1016/0377-2217(93)90016-gnot held here
3ref3 Mansauri S. A., Moattar Husseini S. M., Newman S. T., A review of the modern approaches to multi-criteria cell design, International Journal of Production Research, 2000, 38(5), 1…10.1080/002075400189095not held here
4ref4 Solimanpur M., Vrat P., Shanker R., A multi-objective genetic algorithm approach to the design of cellular manufacturing systems, International Journal of Production Research, 200…10.1080/00207540310001638073not held here
5ref5 Rajamani D., Singh N., Aneja Y. P., Integrated design of cellular manufacturing systems in the presence of alternative process plans, International Journal of Production Research,…10.1080/00207549008942811not held here
6ref6 Logendran R., Ramakrishna P., Sriskandarajah C., Tabu search based heuristics for cellular manufacturing systems in the presence of a process of a alternate process plans, Interna…10.1080/00207549408956933not held here
7ref7 Shanker R., Vrat P., Some design issues in cellular manufacturing using fuzzy programming approach, 1999, 37(11), 2545-256310.1080/002075499190653not held here
8ref8 Moon C., Gen M., A genetic algorithm based approach for design of independent manufacturing cells, 1999, International Journal of Production research, 60-61, 421-42610.1016/s0925-5273(98)00167-4not held here
9ref9 Shanker K., Agrawal A. K., Models and solution methodologies for the generalized grouping problem in cellular manufacturing, International Journal of Production Research, 1997, 35…10.1080/002075497195885not held here
10ref10 Zhao C., Wu Z., A genetic algorithm for manufacturing cell formation with multiple routes and multiple objectives, International Journal of Production Research, 2000, 38(2), 385-3…10.1080/002075400189473not held here
11ref11 Uddin M. K., Shanker K., Grouping parts and machines in presence of alternative process routes by genetic algorithms, 2002, International Journal of Production Economics, 2002, 76…10.1016/s0925-5273(01)00164-5not held here
12ref12 Jayaswal S., Adil G. K., Efficient algorithm for cell formation with sequence data, machine replications and alternative routings, 2004, International Journal of Production Resear…10.1080/00207540310001652914not held here
13ref13 Lei D., Wu Z., Tabu search approach based on a similarity coefficient for cell formation in generalized group technology, 2005, International Journal of Production Research, 43(19…10.1080/00207540500151283not held here
14ref14 Gravel M., Nsakanda A. L., Price W., Efficient solutions to the cell formation problems with multiple routings via double loop genetic algorithm, European Journal of Operational R…10.1016/s0377-2217(98)00057-5not held here
15ref15 Sankaran S., Kasilingam K. G., An integrated approach to cell formation and part routing in group technology, Engineering Optimization, 1990, 16(3), 235-24510.1080/03052159008941175not held here
16ref16 Nagi R., Harhalaskish G., Porth J. M., Multiple routing and capacity consideration in group technology applications, International Journal of Production Research, 1990, 28(12), 22…10.1080/00207549008942864not held here
17ref17 Glover F., Wooley R. E., Further reduction of Zero-one linear program, Operations Research, 1973, 21, 156-16110.1287/opre.21.1.156not held here

The references as JSON

Relations

The record states no relation, and no record held here states one with this DOI.

The relations as JSON

Funding

The record names no funder.

Each funder's page lists every work held here that names it. ROR IDs open at ror.org; Funder Registry IDs resolve at doi.org.

History — the ledger

Every change to this DOI, in order, as it was recorded. Entries are only ever added, never changed or removed.

#WhenWhatByChanges
129 Sep 2026, 10:00 PMregister
registered at Crossref; record read from api.crossref.org
Administrator (admin) 109 fields set · sha256 eef1b0ab3a51…
230 Sep 2026, 12:00 AMupdate
record re-read from api.crossref.org
Administrator (admin)
container.titles.0.value: Journal of Science & Technology → Journal of Science & Technology

Machine-readable: the history as JSON, with the full record after each change.

Changes made at Crossref through DOI Doctor

Every deposit Smart Scholars' DOI Doctor made for this DOI, oldest first, with Crossref's own answer. Each fingerprint is the SHA-256 of its entry and of the fingerprint before it, so a change to any earlier entry changes every fingerprint after it.

WhenWhat changedCrossrefFingerprint
16 Sep 2026, 19:35Address updated
from https://www.jst.org.in/index.php/pub/article/view/935/862 to https://www.jst.org.in/index.php/pub/article/view/935
● accepted by Crossrefa35db088d0ca…
16 Sep 2026, 19:51Read back: the DOI resolves to the new address● confirmeda777307ae3f2…
15 Oct 2026, 15:30Metadata completed
abstract (282 words) · licence
● accepted by Crossrefc6fc14ee0c33…
15 Oct 2026, 16:19Read back: Crossref's record shows it● confirmed47c9a64fe6ee…

4 entries · the last fingerprint 47c9a64fe6ee05da6bd0665e69a65104c44aaa569a6ffba8e78a121e541879c5 · the history as JSON, each entry with the fingerprint before it, to check them yourself.

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