A mixed integer programming model for solving a layout problem in the fashion industry
Article Abstract:
A study was conducted to characterize a mixed integer programming framework that searches for an optimal group of cutting patterns associated with the cutting operation in the high fashion clothing industry. The framework focused on reducing the number of standard rolls to be utilized, minimizing setup costs. The model considered a number of variables, including cutting table length, pattern sets, demand for size, length of each stencil and number of copies of size. The number of cutting proposals for different problem sets were also determined to describe problem complexities. Results showed that the programming model can be utilized in high volume production operations to reduce cloth waste and increase operation efficiency.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1998
User Contributions:
Comment about this article or add new information about this topic:
A cluster - analytic approach to facility layout
Article Abstract:
Visual analytical methods may provide better solutions for facility layout problems than heuristic computer methods, due to the combinatorial properties of such problems. A new algorithm developed for application to such problems is described and analyzed; the algorithm is known as FLAC (facility layout by analysis of clusters). Problems evidencing high and low flow dominance are handled equally well by the FLAC algorithm, as are problems reflecting both line dominance and the absence of line dominance. In addition, the computation times associated with the FLAC algorithm are demonstrated to be an improvement over computation times for previous algorithms.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1985
User Contributions:
Comment about this article or add new information about this topic:
Multi-activity facility design and location problems
Article Abstract:
The problem of optimal location of facilities design to provide several services involving several activities is solved using branch-and-bound algorithms. The problem is stated such that the activities of each facility must also be identified in the solution, and fixed costs are assigned to the establishment of each facility and the activities it will be responsible for. The branch-and-bound solutions discussed also allow for various assumptions related to facility capacities. Computational results for the branch-and-bound algorithms are listed; these are extensive.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1985
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Investment planning and arm's length control in a nationalised industry. Large scale portfolio optimization
- Abstracts: A Foreward Simplex Method for Staircase Linear Programs. Oligopoly Models for Optimal Advertising When Production Costs Obey a Learning Curve
- Abstracts: A Silicon Valley of the East: creating Taiwan's semiconductor industry. Capital financing strategies of the Japanese semiconductor industry
- Abstracts: Evaluating merger performance. Sanctions, incentives, and corporate behavior
- Abstracts: Construing organizational texture in young entrepreneurial firms