Time and cost optimization using scheduling job shop and linear goal programming model

Biandina Meidyani, R. Sarno, Afina Lina Nurlaili
{"title":"Time and cost optimization using scheduling job shop and linear goal programming model","authors":"Biandina Meidyani, R. Sarno, Afina Lina Nurlaili","doi":"10.1109/ICOIACT.2018.8350720","DOIUrl":null,"url":null,"abstract":"Time and cost optimization is a way to determine the optimal time and cost to use. Usually the faster the time the cost is more. To determine the time of peractivity used schedulling jobshop. The problem is whether the system that companies do so far is the best system or not. Activity issues include how to design some regulatory activities while minimizing total time, and total distribution costs. This problem is encountered in the case of Surabaya Container. In this paper, we discussed how to apply goal programming method to create activity model with company's constraints to obtain more optimal results. By developing a pre-existing activity model and using the help of the LINGO 11.0 program, the determination of the route with the goal programming method can be completed. The results obtained show that activity is formed with time, and the minimum cost. Moreover, in this paper will also compare the scheduling flow shop and job shop. Job shop produces less time than flow shop.","PeriodicalId":6660,"journal":{"name":"2018 International Conference on Information and Communications Technology (ICOIACT)","volume":"134 1","pages":"555-560"},"PeriodicalIF":0.0000,"publicationDate":"2018-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Information and Communications Technology (ICOIACT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIACT.2018.8350720","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Time and cost optimization is a way to determine the optimal time and cost to use. Usually the faster the time the cost is more. To determine the time of peractivity used schedulling jobshop. The problem is whether the system that companies do so far is the best system or not. Activity issues include how to design some regulatory activities while minimizing total time, and total distribution costs. This problem is encountered in the case of Surabaya Container. In this paper, we discussed how to apply goal programming method to create activity model with company's constraints to obtain more optimal results. By developing a pre-existing activity model and using the help of the LINGO 11.0 program, the determination of the route with the goal programming method can be completed. The results obtained show that activity is formed with time, and the minimum cost. Moreover, in this paper will also compare the scheduling flow shop and job shop. Job shop produces less time than flow shop.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用作业车间调度和线性目标规划模型进行时间和成本优化
时间和成本优化是一种确定最佳使用时间和成本的方法。通常越快的时间成本越高。要确定使用调度作业车间的活动时间。问题是,企业目前的制度是不是最好的制度。活动问题包括如何设计一些监管活动,同时最小化总时间和总分销成本。泗水集装箱遇到了这个问题。本文讨论了如何应用目标规划方法建立具有公司约束的活动模型,以获得更优的结果。通过建立已有的活动模型,利用LINGO 11.0程序,利用目标规划法完成路线的确定。结果表明,活性是随时间形成的,且成本最小。此外,本文还对调度流程车间和作业车间进行了比较。作业车间比流水车间生产时间少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Data Normalization and Database Design for Joglosemar Tourism Management of fault tolerance and traffic congestion in cloud data center Development of smart public transportation system in Jakarta city based on integrated IoT platform Improving the quality of enterprise IT goals using COBIT 5 prioritization approach Data mining technique with cluster anaysis use K-means algorithm for LQ45 index on Indonesia stock exchange
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1