ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

Minimizing flow time in a flow-line manufacturing cell with family setup times

Gupta, JND*; Schaller, JE
Journal of the Operational Research Society2006-2DOI: 10.1057/palgrave.jors.2601971
31被引1阅读
引用收藏
分享

摘要

This paper considers the problem of scheduling part families and jobs within each part family in a flowline manufacturing cell with independent family setup times where parts ( jobs) in each family are processed together. The objective is to minimize total flow time. A branch-and-bound algorithm capable of solving moderate sized problems is developed. Several heuristic algorithms are proposed and empirically evaluated as to their effectiveness and efficiency in finding optimal permutation schedules. These results show that several heuristic algorithms generate solutions that are better than those generated by an existing genetic algorithm.

学科与关键词

关键词
flowshop schedulingfamily setupslower boundsheuristic algorithmsmanufacturing cellsempirical results
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
Journal of the Operational Research Society
发表日期
2006-02
卷期
第 57 卷, 第 2 期
页码
163-176
DOI
10.1057/palgrave.jors.2601971
语言
ENGLISH
成果收录
SCIE

作者

  • G

    Gupta, JND (通讯) (第一作者)

  • S

    Schaller, JE

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417