Optimal Production LineLayout Model Based on Integer Programming

2013 ◽  
Vol 690-693 ◽  
pp. 2896-2900
Author(s):  
Yong Zhao ◽  
Xiao Yong Pan ◽  
Chun Chuan Li ◽  
Guo Hong Yao ◽  
Jiang Wu ◽  
...  
Keyword(s):  
Integer Programming ◽  
Production Line ◽  
Ant Colony Algorithm ◽  
Programming Model ◽  
Theory Analysis ◽  
Layout Problem ◽  
Optimal Production ◽  
Multi Stage ◽  
The Cost ◽  
Line Design

To control the cost and optimize the resource utilization of enterprises, production layout problem draws recently more and more attention by industries; however, a study on this problem indicates there is a lack of research on production line design, which is a major issue in the layout problem. Traditional methodology mainly depends on the designer’s experience and calls for theory analysis and quantitative study. This paper concerns the development of a multi-stage integer programming model to describe the production line layout problem, and employs a heuristic and ant-colony algorithm to solve the problem. A practical example illustrates the effectiveness of the model.

Modeling and Case Study of the Production Line Layout System

2013 ◽  
Vol 416-417 ◽  
pp. 1373-1380
Author(s):  
Yong Zhao ◽  
Xiao Yong Pan ◽  
Chun Chuan Li
Keyword(s):  
Integer Programming ◽  
Resource Utilization ◽  
Production Line ◽  
Programming Model ◽  
Theory Analysis ◽  
Layout Problem ◽  
Multi Stage ◽  
The Cost ◽  
Line Design

A study on production line layout problem indicates there is a lack of research on the production line design issue. Traditional methodology on this problem mainly depends on the designers experience and calls for theory analysis and quantitative study. To control the cost and optimize the resource utilization of enterprises, this paper develops a multi-stage integer programming model to describe the production line layout problem, and proposes a heuristic algorithm to solve the problem. A practical example illustrates the effectiveness of the model.

Evaluating Design Alternatives of an Extruded Food Production Line Using Simulation

SIMULATION ◽  
2002 ◽  
Vol 78 (10) ◽  
pp. 626-632 ◽  
Author(s):  
Stephen F. Owens ◽  
Reuven R. Levary
Keyword(s):  
Production Line ◽  
Food Production ◽  
System Throughput ◽  
Unit Operations ◽  
Manufacturing Line ◽  
Design Alternatives ◽  
Current Design ◽  
Current Production ◽  
The Cost ◽  
Line Design

Several designs of a manufacturing line for the production of extruded foods were developed and compared with the current production line design. The manufacturing line consisted of six unit operations: batching, grinding, extruding, drying, further processing, and packing. The authors performed the comparisons by simulating the current design and the proposed alternatives. The alternatives consisted of modifications to the extruder-dryer and/or packing line designs. The simulation results indicated that all the alternate designs roughly doubled system throughput compared to current designs but did not differ significantly in performance among themselves. The doubled output is worth about $2.5 million per year. This is easily enough to justify the cost of new equipment. One design would cost less to implement than the others and thus was the preferred option.

A framework of hiring strategy for manpower hiring in a hyper-local food delivery organization

2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Debadyuti Das ◽  
Chirag Yadav
Keyword(s):  
Integer Programming ◽  
Programming Model ◽  
Local Food ◽  
Service Level ◽  
Food Delivery ◽  
Optimum Number ◽  
Content Type ◽  
Integer Programming Model ◽  
Cost Efficient ◽  
The Cost

PurposeThe present work attempts to determine an appropriate number of different categories of Delivery Persons for a Hyper-local Food Delivery Organization for different intervals within a day and across days within a week which would provide a satisfactory level of service to the target customers and at the same time would become cost-efficient.Design/methodology/approachCurrently the firm estimates the required number of Delivery Persons for “lunch peak” and “dinner peak” of the next week's weekdays and weekend based on the maximum number of orders occurring during the same period of both weekdays and weekend in the current week. The proposed approach involves determining the projected demand in every four-hourly interval of both week-days and weekend in the next week. Subsequently, the study has developed a simple integer programming model for determining the optimum number of Delivery Persons based on the projected demand data.FindingsThe existing approach followed by the firm indicates that the Delivery Persons remain unutilized during periods of low demand. The proposed model demonstrated savings to the tune of 21.4% in manpower cost without any erosion in the service level.Originality/valueThe study has made three tangible contributions. First, the development of a simple methodology for estimating the demand of next period allows the Managers to utilize dynamic demand data. Second, the development of a simple integer programming model helps managers determine an appropriate number of Delivery Persons in different intervals in both weekdays and weekend. Third, the development of a framework of hiring strategy aids managers in adopting a particular hiring strategy under a particular context keeping in mind the magnitude of demand for food, demand for delivery service and the cost of providing the service.

A bicriteria integer programming model for the hierarchical workforce scheduling problem

2010 ◽  
Vol 5 (1) ◽  
pp. 54-62 ◽  
Author(s):  
Rafael Pastor ◽  
Albert Corominas
Keyword(s):  
Integer Programming ◽  
Design Methodology ◽  
Programming Model ◽  
Task Assignment ◽  
Scheduling Problem ◽  
Workforce Scheduling ◽  
Content Type ◽  
Integer Programming Model ◽  
The Cost ◽  
S Model

PurposeThe purpose of this paper is to propose a bicriteria integer programming model for hierarchical workforce scheduling in which the first criterion is the cost and the second is the suitability of task assignment to individual employees. The model is based on the integer programming formulation for the hierarchical workforce scheduling problem published in 2007 by Seçkiner et al., which extends the model proposed by Billionnet in 1999.Design/methodology/approachThe principal hypothesis of this paper is that, although an employee is capable of performing several different tasks with equal efficiency, the type of task to which he/she is assigned affects the overall suitability of the assignment configuration. Therefore, cost‐minimising solutions should also optimise task assignment when possible. This paper considers real cases and confirm that this approach to the problem is appropriate for dealing with common situations in personnel management.FindingsThe proposed idea is applied to the example problem used by Seçkiner et al. and the results are compared with Seçkiner et al.'s model results.Originality/valueConsequently, the proposal is more general and a more faithful representation of the problems faced by personnel managers, which should help to bridge the gap between academic studies and practical cases.

scholarly journals Non-linear Integer Programming Model and Algorithms for Connected p-facility Location Problem

2014 ◽  
Vol 2 (5) ◽  
pp. 451-460 ◽  
Author(s):  
Jianming Zhu
Keyword(s):  
Integer Programming ◽  
Facility Location ◽  
Shortest Path ◽  
Location Problem ◽  
Programming Model ◽  
Maximum Clique ◽  
Facility Location Problem ◽  
Linear Integer Programming ◽  
Non Linear ◽  
The Cost

AbstractIn this paper, a new location analysis method is presented. Given a connected graphG= (V, E)with nonnegative edge costcefor each edgee∊E,dijis the cost of the shortest path between verticesiandjin the graph. TheConnected p-facility Location Problem(CpLP) is to choosepvertices fromVso as to minimize the total cost of shortest path of pair-wise of thesepvertices. This problem is proved to be NP-hard and non-linear integer programming is formulated. Then, two algorithms are designed for solving the CpLP. One is a heuristic algorithm based on classical maximum clique approach, while the second one is genetic algorithm. Finally, computational results show the comparison between these two algorithms.

scholarly journals REDESIGNING THE ASSIGNMENT OF INTERNAL AUDITORS BASED ON AUDITOR UTILITY

2016 ◽  
Vol 4 (3) ◽  
pp. 246-259
Author(s):  
BURCU KARAÖZ
Keyword(s):  
Integer Programming ◽  
Programming Model ◽  
Ahp Method ◽  
Utility Level ◽  
Total Utility ◽  
Integer Programming Model ◽  
Internal Auditors ◽  
The Cost ◽  
Novel Model

This study presents a novel model for assignment of internal auditors to branches of businesses. Previous studies have concerned with minimizing the cost but in this model, aim is maximizing auditor’s utility. For this purpose an integer programming model introduced. The objective is maximizing the auditors’ total utility. Each branch has different impact values for auditors, which indicate auditors’ utility level in terms of location, size and type of branches. Also to keep the balance of auditor’s working days and total gained impact values particular constraints are defined for the integer programming model. This implementation has 3 particular steps; first is quantification of the branches’ effects on the auditors. AHP method is used to define branches’ impact values. The second is simulating the durations of auditing process. To minimize the effect of abnormal situations, durations are simulated. Last step is to reach the rotation of auditors, total working days and the total utility of the auditor; the integer programming model is solved by Python-Gurobi Optimizer.

Sign in / Sign up

Export Citation Format

Share Document