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

An optimal solution algorithm for the constant lot-size model with equal and unequal sized batch shipments for the single product multi-stage production system

引用

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 1995年第2期42卷 161-174页

作者： Hoque, MA Kingsman, BG JAHANGIRNAGAR UNIV DEPT MATHSAVAR DHAKABANGLADESH

This paper presents a new heuristic solution procedure for the constant lot-size model for the production of a single product requiring processing through a fixed sequence of manufacturing stages. There is a single set-up at each production stage followed by continuous production of the whole lot. However, the lot may be transferred to subsequent stages in partial lots, a set of possibly unequal batches, which may vary in size between production stages. Previous models have used a heuristic solution procedure based on the concept of differentiation of the cost function, the sum of the costs of set-up, transportation and inventory. This approach has drawbacks when many of the parameters have to be integer. It also implicitly assumes the cost is a convex function of the lot size. In this situation it can be shown that the function may often be non-convex. Furthermore, the heuristic does not provide a solution directly when the production rates of machines in adjacent stages are equal, and is also unable to consider zero transportation cost. By formulating the constraint that the largest batch size at any stage does not exceed the transport equipment capacity in a different way, a number of properties that the optimal solution should satisfy are developed. An algorithm giving the optimal solution is then derived based on these properties. This is illustrated by numerical examples, which indicate further cost reductions on the most recent models proposed are possible. This modified model and solution enables the sensitivity of the total cost to variations in lot size around the optimal value to be investigated.

关键词： optimal solution algorithm constant lot-size model single product multi-stage production system

来源：评论

学校读者我要写书评

暂无评论

Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights

引用

OPTIMIZATION LETTERS 2021年第6期15卷 2311-2319页

作者： Lv, Dan-Yang Wang, Ji-Bo Shenyang Aerosp Univ Sch Sci Shenyang Peoples R China

In a recent paper, Jiang et al. (EngOptim 52(1):37-52, 2020) considered proportionate flowshop scheduling with position-dependent weights. For common and slack due-date assignment problems, they proved that both of these two problems can be solved in O(n(2) log n) time, where n is the number of jobs. The contribution of this paper is that we show that these two problems can be optimally solved by a lower-order algorithm, i.e., in O(n log n) time.

关键词： Scheduling Proportionate flowshop Due-date assignment optimal solution algorithm algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：