检索结果-内蒙古大学图书馆

Mathematical model for the Home Health Care Scheduling and Routing Problem with Flexible Lunch Break Requirements

IFAC-PapersOnLine 2018年第11期51卷 334-339页

作者： Xiao, Liyang Dridi, Mahjoub El Hassani, Amir Hajjam Nanomedicine Lab Univ. Bourgogne Franche-Comté UTBM BelfortF-90010 France

This paper formulates a mixed integer linear programming model of a home health care scheduling and routing problem with daily planning horizon. The entire procedure involves dispatching caregivers to serve visits demanded by patients at their homes with the objective function aims at minimizing the total operating cost. In some cases, based on the needs of patients, several caregivers should be synchronized and allocated to one patient under a given time window. The proposed model also accounts for multiple constraints such as the restricted working duration, the qualification and preference of patients, and innovative flexible lunch break requirements. Finally, the problem is solved to optimality by Gurobi, a commercial program solver. Numerical results shown that the solution performs quite well compared to the previous artificial planning collected in the Institute Montéclair, shows the the problems can be solved efficiently for optimal solutions. © 2018

关键词： Home health care integer programming Scheduling Synchronization Lunch breaks mixed integer linear programming model Multiple constraint Numerical results Objective functions Optimal solutions Routing problems Scheduling and routing

来源：评论

学校读者我要写书评

暂无评论

An MILP model for Scheduling Multistage, Multiproducts Milk Processing

引用

IFAC-PapersOnLine 2016年第12期49卷 869-874页

作者： Touil, A. Echchatbi, A. Charkaoui, A. Faculty of Science and Technology BP: 577 Settat Morocco

In this paper, a mixed integer linear programming (MILP) model is developed to address production scheduling problems in multistage, multiproduct milk processing. Our model includes several technological constraints typically arising in the dairy industry, such as dependent sequence changeover time, machine speed, and taking into account the packaging timing and capacity constraints. The objective is to minimize the makespan. Numerical results with small instances are presented to demonstrate the efficiency of the proposed model for an industrial case study of a leading company of the dairy industry in Morocco. © 2016

关键词： integer programming Dairies Dairy products Production control Scheduling Capacity constraints Dairy industry Industrial case study Milk production mixed integer linear programming (MILP) mixed integer linear programming model Production scheduling problems Technological constraints

来源：评论

学校读者我要写书评

暂无评论

An improved flow-based formulation and reduction principles for the minimum connectivity inference problem

引用

OPTIMIZATION 2019年第10期68卷 1963-1983页

作者： Dar, Muhammad Abid Fischer, Andreas Martinovic, John Scheithauer, Guntram Tech Univ Dresden Fac Math Inst Numer Math Dresden Germany

The Minimum Connectivity Inference (MCI) problem represents an -hard generalization of the well-known minimum spanning tree problem and has been studied in different fields of research independently. Let an undirected complete graph and finitely many subsets (clusters) of its vertex set be given. Then, the MCI problem is to find a minimal subset of edges so that every cluster is connected with respect to this minimal subset. Whereas, in general, existing approaches can only be applied to find approximate solutions or optimal edge sets of rather small instances, concepts to optimally cope with more meaningful problem sizes have not been proposed yet in literature. For this reason, we present a new mixed integer linear programming formulation for the MCI problem, and introduce new instance reduction methods that can be applied to downsize the complexity of a given instance prior to the optimization. Based on theoretical and computational results both contributions are shown to be beneficial for solving larger instances.

关键词： Minimum connectivity inference reduction rules mixed integer linear programming model subset interconnection design

来源：评论

学校读者我要写书评

暂无评论

A Real Multi-Objective Bin Packing Problem: A Case Study of an Engine Assembly Line

引用

ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING 2014年第6期39卷 5271-5277页

作者： Naderi, B. Yazdani, Mehdi Univ Kharazmi Fac Engn Dept Ind Engn Karaj Iran Islamic Azad Univ Dept Ind Engn Qazvin Branch Qazvin Iran

This paper studies a real case of bin packing problems. The problem is inspired from a car manufacturer that aims at improving logistic activities of its engine assembly line. It is to plan transportations of parts from a warehouse to workstations. The first objective is to find the minimum possible motorized vehicles to conduct all the transportations. The second objective is to smooth the workload of vehickles to the maximum extent possible. To tackle the problem, it is first formulated in form of a mixed integer linear programming model. Then, a local-based greedy heuristic is proposed to solve the problem in large-sized cases.

关键词： Multi-objective bin packing problem mixed integer linear programming model Local search-based greedy heuristic

来源：评论

学校读者我要写书评

暂无评论

A column generation algorithm for the Buffer Allocation Problem approximated by the Time Buffer concept

引用

IFAC-PapersOnLine 2016年第12期49卷 739-744页

作者： Alfieri, A. Matta, A. Pastore, E. Department of Management and Production Engineering Politecnico di Torino 24 c.so Duca degli Abruzzi Torino10129 Italy Shanghai200240 China

The Buffer Allocation Problem deals with buffer sizing in production systems. In particular, the objective is to find an optimal buffer size configuration achieving some target performance measure. It has two main tasks to accomplish: searching for an optimal system configuration and assessing the system performance. In real setting, simulation-optimization is the common technique to approach this problem. Recently, an approximated mathematical programming approach has been developed for BAP simulation-optimization. The approximation consists in modeling queues with temporal lags (time buffer) and allows to devise linear programming (LP) instead of mixed integer linear programming (MILP) models. This latter makes easier the solution process, which remains a challenge due to the models huge and complex dimension solution space topology. In this paper, we propose an exact method for the solution of the time buffer approximated BAP. Tests on randomly generated instances showed that the proposed method is computationally more efficient than standard LP solver in most of the cases. © 2016

关键词： integer programming Reservation systems Buffer sizing Exact methods Manufacturing process mixed integer linear programming model Optimal system configuration Performance measure simulation Simulation optimization

来源：评论

学校读者我要写书评

暂无评论

The two-machine flow shop problem with conflict graphs

引用

IFAC-PapersOnLine 2016年第12期49卷 1026-1031页

作者： Tellache, Nour El Houda Boudhar, Mourad RECITS Laboratory Faculty of Mathematics USTHB university BP 32 El-Alia Bab-Ezzouar Algiers Algeria

In this paper, we consider the problem of scheduling jobs on a two-machine flow shop subject to constraints represented by an undirected graph G, in which each edge joins a pair of conflicting jobs that cannot be processed simultaneously on different machines. The problem of minimizing the maximum completion time (makespan) is known to be NP-hard in the strong sense even when all the operations require one unit of processing time. We prove that the permutation schedules are not dominant even for two machines, and we present a special case for which an optimal schedule can be found by a permutation schedule. On the other hand, we propose four mixed integer linear programming (MILP) models alongside with an experimental study to measure their performance on a wide range of test problems. © 2016

关键词： Job shop scheduling Flow graphs integer programming linear programming Machine shop practice Machine shops Scheduling complexity Conflict graph Flow shops Maximum completion time mixed integer linear programming model Permutation schedules Two machine flow shop Two machine flow shop problem

来源：评论

学校读者我要写书评

暂无评论

A Production Inventory Routing Planning for Perishable Food with Quality Consideration

引用

IFAC-PapersOnLine 2016年第3期49卷 407-412页

作者： LI, Yantong CHU, Feng YANG, Zhen Calvo, Roberto Wolfler Laboratory IBISC University of Evry-Val d'Essonne Evry France School of Management Xi'an Jiaotong University Xi'an China Université Paris 13 Sorbonne Paris Citè Villetaneuse France

We formulate the production inventory routing planning with an integrated mixed integer linear programming (MILP) model where the food quality level is explicitly traced throughout the supply chain. The objective of the proposed model is to maximize the total profit, which equals the selling revenue minus the summation of the production, inventory and transportation cost. We then use illustrative examples to show the effectiveness of the model and to investigate the impact of perishability. Analyses based on the computational results of a set of randomly generated instances are given. © 2016

关键词： integer programming Optimization Supply chains Computational results Food quality MILP mixed integer linear programming model Production inventories Total profits Transportation cost

来源：评论

学校读者我要写书评

暂无评论

model of decision support for the configuration of manufacturing system

引用

IFAC-PapersOnLine 2019年第13期52卷 826-831页

作者： Wikarek, Jaroslaw Sitek, Pawel Nielsen, Peter Institute of Management and Control Systems Kielce University of Technology Al. 1000-lecia PP 7 Kielce25-314 Poland Dept. of Materials and Production Aalborg University Aalborg Denmark

Manufacturing enterprises today have to face the volatility of markets, characterized by a decreasing production volume and an increasing number of product variants to meet customer expectations. Traditional dedicated manufacturing lines (DML) have been replaced by flexible manufacturing systems (FMS) and, recently, by the systems that combine features of DML and FMS, i.e., by reconfigurable manufacturing systems (RMS). Appropriate manufacturing support and optimization systems for FMS and RMS will advance the quality and effectiveness of reconfigurable manufacturing. This paper proposes an original mixed integer linear programming (MILP) model for decision support in configuration and reconfiguration of the manufacturing system. The modeled problem is a certain development of the known machine loading problem MLP. In this approach, we generate a highly parameterized model based on a set of constraints and a set of questions. Different mathematical programming (MP) - based solvers are proposed to solve this model. © 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Flexible manufacturing systems Computer aided manufacturing Decision support systems integer programming Mathematical programming Optimization Customer expectation Decision supports Machine loading problems Manufacturing enterprise Manufacturing lines mixed integer linear programming model Reconfigurable manufacturing Reconfigurable manufacturing system

来源：评论

学校读者我要写书评

暂无评论

Minimizing operators’ walking times into a linear system layout

引用

IFAC-PapersOnLine 2016年第12期49卷 1709-1714页

作者： Gebennini, Elisa Zeppetella, Luca Grassi, Andrea Rimini, Bianca Dipartimento di Scienze e Metodi dell'Ingegneria Università degli Studi di Modena e Reggio Emilia Via Amendola 2 Reggio42122 Italy

This paper deals with the assignment of stations to operators into flexible manufacturing systems by minimizing the operators’ walking times over a given planning horizon. The manufacturing system is supposed to present a linear layout where the stations are aligned along a longitudinal axis. Stations are flexible (so that different jobs can be scheduled on the same station along the planning horizon) and may differ from each other in terms of degree of automation and, consequently, in terms of amount of human labor involved. Thus, two or more stations might share the same operator within the working shift and, consequently, the assignment of the optimal subset of stations to each operator is anything but trivial. Hence, a mixed-integer linear programming model is proposed which takes into account (and minimizes) the travel walking distances of the operators according to the assigned subset of stations. Other realistic constraints, such as the actual availability of the operators and the requirement stating that each scheduled job has to be assigned to a single operator for its entire duration, are included in the model. The validity of the model is proved by discussing a real-world case study from the plastic industry. © 2016

关键词： integer programming Combinatorial optimization Flexible manufacturing systems linear systems Plant layout Assignment problems Degree of automation linear programming models Longitudinal axis mixed integer linear programming model Optimal subsets Planning horizons Plastic industry

来源：评论

学校读者我要写书评

暂无评论

Solving a real bi-objective skilled agent assignment problem in the service-to-business domain, considering both economic efficiency and agent satisfaction

引用

IFAC-PapersOnLine 2019年第13期52卷 2026-2031页

作者： Doan, M.P. Fondrevelle, J. Botta-Genoulaz, V. Ribeiro, J.F.F. Univ Lyon INSA-Lyon DISP EA4570 Villeurbanne cedex69621 France University of Sao Paulo USP-FEARP-RAD Ribeirao Preto SP14040-905 Brazil

In this article, we introduce a mixed integer linear programming (MILP) model for a real bi-objective agent assignment problem in the service-to-business domain. Agents with different skill types, skill levels and work contract types have to be assigned to tasks required by clients. Tasks usually require a big number of agents but this number is stable over time. Choosing the assignment, the company has two important objectives to attain including minimizing the global travel costs and maximizing the satisfaction level of its agents related to their average work trip duration. Based on the MILP model proposed, we perform some experiments on a real database provided by a Brazilian partner. These experiments allow us to study the interactions between the objectives, and the impact of some important characteristics on the solutions of the problem. © 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： integer programming Combinatorial optimization Multiobjective optimization Personnel Activity scheduling Assignment problems Business domain Economic efficiency MILP model mixed integer linear programming model Skilled personnel Workforce assignment

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：