NDLI: Exact model for the cell formation problem

Content Provider	Springer Nature Link
Author	Bychkov, Ilya Batsyn, Mikhail Pardalos, Pas M.
Copyright Year	2014
Abstract	The cell formation problem (CFP) consists in an optimal grouping of the given machines and parts into cells, so that machines in every cell process as much as possible parts from this cell (intra-cell operations) and as less as possible parts from other cells (inter-cell operations). The grouping efficacy is the objective function for the CFP which simultaneously maximizes the number of intra-cell operations and minimizes the number of inter-cell operations. Currently there are no exact approaches (known to the authors) suggested for solving the CFP with the grouping efficacy objective. The only exact model which solves the CFP in a restricted formulation is due to Elbenani and Ferland (Cell formation problem solved exactly with the dinkelbach algorithm. Montreal. Quebec. CIRRELT-2012-07, 1–14, 2012). The restriction consists in fixing the number of production cells. The main difficulty of the CFP is the fractional objective function—the grouping efficacy. In this paper we address this issue for the CFP in its common formulation with a variable number of cells. Our computational experiments are made for the most popular set of 35 benchmark instances. For the 14 of these instances using CPLEX software we prove that the best known solutions are exact global optimums.
Starting Page	2203
Ending Page	2210
Page Count	8
File Format	PDF
ISSN	18624472
Journal	Optimization Letters
Volume Number	8
Issue Number	8
e-ISSN	18624480
Language	English
Publisher	Springer Berlin Heidelberg
Publisher Date	2014-02-12
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Cell formation problem Exact model Grouping efficacy Fractional objective function Optimization Operations Research/Decision Theory Computational Intelligence Numerical and Computational Physics
Content Type	Text
Resource Type	Article
Subject	Control and Optimization Business, Management and Accounting

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

The fractional minimal cost flow problem on network

Solving the clique partitioning problem as a maximally diverse grouping problem

Extragradient-type method for optimal control problem with linear constraints and convex objective function

On a fractional minimal cost flow problem on networks

Smooth exact penalty functions: a general approach

An exact penalty function method for nonlinear mixed discrete programming problems

Conjugate gradient methods using value of objective function for unconstrained optimization

Special Issue: Control and Optimization

Parametric network utility maximization problem

Exact model for the cell formation problem

Similar Documents

The fractional minimal cost flow problem on network

Solving the clique partitioning problem as a maximally diverse grouping problem

Extragradient-type method for optimal control problem with linear constraints and convex objective function

On a fractional minimal cost flow problem on networks

Smooth exact penalty functions: a general approach

An exact penalty function method for nonlinear mixed discrete programming problems

Conjugate gradient methods using value of objective function for unconstrained optimization

Special Issue: Control and Optimization

Parametric network utility maximization problem

Exact model for the cell formation problem