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

Improved bounded dynamic programming algorithm for solving the blocking flow shop problem

CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH 2019年第1期27卷 15-38页

作者： Ozolins, Ansis Univ Latvia Zellu St 25 LV-1002 Riga Latvia

In this paper, the blocking flow shop problem is considered. An exact algorithm for solving the blocking flow shop problem is developed by means of the bounded dynamic programming approach. The proposed algorithm is tested on several well-known benchmark instances. Computational results show that the presented algorithm outperforms all the state-of-the-art exact algorithms known to the author. Additionally, the optimality is proven for 26 previously open instances. Furthermore, we provide new lower bounds for several benchmark problem sets of Taillard requiring a relatively short CPU time.

关键词： Scheduling Blocking flow shop bounded dynamic programming Exact method

来源：评论

学校读者我要写书评

暂无评论

Procedures for the Time and Space constrained Assembly Line Balancing Problem

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2011年第3期212卷 473-481页

作者： Bautista, Joaquin Pereira, Jordi Univ Politecn Cataluna E-08028 Barcelona Spain

The Time and Space constrained Assembly Line Balancing Problem (TSALBP) is a variant of the classical Simple Assembly Line Balancing Problem that additionally accounts for the space requirements of machinery and assembled parts. The present work proposes an adaptation of the bounded dynamic programming (BDP) method to solve the TSALBP variant with fixed cycle time and area availability. Additionally, different lower bounds for the simple case are extended to support the BD P method as well as to assess the quality of the obtained solutions. Our results indicate that the proposed bounds and solution procedures outperform any other previous approach found in the literature. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Manufacturing Assembly Line Balancing Lower bounds Column generation bounded dynamic programming

来源：评论

学校读者我要写书评

暂无评论

A dynamic programming based heuristic for the assembly line balancing problem

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2009年第3期194卷 787-794页

作者： Bautista, Joaquin Pereira, Jordi Univ Politecn Cataluna Escola Tecn Super Engn Ind Barcelona Dept Org Empreses E-08028 Barcelona Spain Univ Politecn Cataluna Nissan Chair E-08028 Barcelona Spain

The simple assembly line balancing problem is the simplification of a real problem associated to the assignment of the elementary tasks required for assembly of a product in an assembly line. This problem has been extensively studied in the literature for more than half a century. The present work proposes a new procedure to solve the problem we call bounded dynamic programming. This use of the term bounded is associated not only with the use of bounds to reduce the state space but also to the reduction of such space based on heuristics. This procedure is capable of obtaining an optimal solution rate of 267 out of 269 instances, which have been used in previous works, thus obtaining the best-known performance for the problem. These results are an improvement from any previous procedure found in the literature even when using smaller computing times. (C) 2008 Elsevier B.V. All rights reserved.

关键词： Car manufacturing Production bounded dynamic programming Assembly line balancing

来源：评论

学校读者我要写书评

暂无评论

Priority rules-based algorithmic design on two-sided assembly line balancing

引用

PRODUCTION ENGINEERING-RESEARCH AND DEVELOPMENT 2018年第1期12卷 95-108页

作者： Li, Yuchen Coit, David Beijing Univ Technol Coll Econ & Management Beijing Peoples R China Rutgers State Univ Ind & Syst Engn New Brunswick NJ USA

The two-sided assembly line becomes very popular in recent years. In this paper, a priority rules-based algorithmic design is developed for optimizing two-sided assembly line. Five elementary rules and 90 composite rules are tested on the benchmark data sets and their performance are provided. Two enumerative principles, which are specific to two-sided assembly lines are proposed to enhance the performance of the rules. Further, priority rules are embedded into a bounded dynamic programming framework to form a deterministic algorithm where the use of a bound can reduce the solution space as the algorithm is advanced stage-by-stage. These approaches offer distinct advantages over the methods proposed in the literature, such as less fine-tuning effort and more stable results. Computational results show that the novel algorithm can generate good solutions efficiently, especially in large sized problems.

关键词： Two-sided assembly line balancing Priority rules-based methods bounded dynamic programming Solution space reduction approaches Deterministic algorithm

来源：评论

学校读者我要写书评

暂无评论

Heuristics and exact algorithms for solving the Monden problem

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1996年第1期88卷 101-113页

作者： Bautista, J Companys, R Corominas, A UNIV POLITECN CATALUNA DEPT MANAGEMENT E-08028 BARCELONA SPAIN

Sequencing units on an assembly line in order to obtain a regular requirement of resources is a problem that can be modelled in a variety of ways. One of the most popular is known as the Monden problem, and the heuristic proposed to obtain a 'satisfactory' solution is called 'goal-chasing' method. In the paper the myopic behaviour of this heuristic is shown, and some improvements are proposed. An exact procedure, based on BDP, is also proposed. By relaxing the assumptions, the BDP procedure becomes a new, powerful heuristic. A sample of computational results is included.

关键词： sequencing units on assembly lines JIT bounded dynamic programming

来源：评论

学校读者我要写书评

暂无评论

A GRASP Algorithm to Optimize Operational Costs and Regularity of Production in Mixed-Model Sequencing Problems with Forced Interruption of Operations 18th

A GRASP Algorithm to Optimize Operational Costs and Regulari...

引用

18th Conference of the Spanish-Association-for-Artificial-Intelligence (CAEPIA)

作者： Bautista-Valhondo, Joaquin Alfaro-Pozo, Rocio Univ Politecn Cataluna IOC ETSEIB Diagonal 647 E-08028 Barcelona Spain EAE Business Sch C Arago 55 Barcelona 08015 Spain

ISBN: (纸本)9783030003746;9783030003739

We present a GRASP algorithm to solve a problem that involves the sequencing of mixed products in an assembly line. The objective of the problem is to obtain a manufacturing sequence of models that generates a minimum operational cost with a forced interruption of operations and that is regular in production. The implemented GRASP is compared with other procedures using instances of a case study of the Nissan engine manufacturing plant in Barcelona.

关键词： GRASP bounded dynamic programming Work overload Operational cost Mixed-model sequencing problems

来源：评论

学校读者我要写书评

暂无评论

dynamic programming

Dynamic Programming

引用

作者： Ö. Ufuk Nalbantoğlu

Independent scoring of the aligned sections to determine the quality of biological sequence alignments enables recursive definitions of the overall alignment score. This property is not only biologically meaningful but it also provides the opportunity to find the optimal alignments using dynamic programming-based algorithms. dynamic programming is an efficient problem solving technique for a class of problems that can be solved by dividing into overlapping subproblems. Pairwise sequence alignment techniques such as Needleman–Wunsch and Smith–Waterman algorithms are applications of dynamic programming on pairwise sequence alignment problems. These algorithms offer polynomial time and space solutions. In this chapter, we introduce the basic dynamic programming solutions for global, semi-global, and local alignment problems. Algorithmic improvements offering quadratic-time and linear-space programs and approximate solutions with space-reduction and seeding heuristics are discussed. We finally introduce the application of these techniques on multiple sequence alignment briefly. less

关键词： Pairwise Sequence Alignment Multiple Sequence Alignment Seeding dynamic programming Needleman–Wunsch algorithm Smith–Waterman algorithm Affine gap penalties Hirschberg’s algorithm Banded dynamic programming bounded dynamic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：