当前位置: X-MOL 学术Eng. Optim. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs
Engineering Optimization ( IF 2.2 ) Pub Date : 2021-05-02 , DOI: 10.1080/0305215x.2021.1919098
Feristah Ozcelik 1 , Mehmet Ertem 1, 2 , Tugba Saraç 1
Affiliation  

In the injection moulding process, a set-up containing positioning moulds, a cleaning raw material hopper and machine settings is required. The set-up is uncertain owing to random factors, such as the crew’s skill levels and unexpected breakdowns. The general version of this problem is known as the single-machine scheduling problem with stochastic sequence-dependent set-up times. In this specialized form of the problem, the objective function is defined so as to minimize the total expected cost, which includes set-up, tardiness and earliness costs. Moreover, the effect of the client-dependent tardiness cost on the optimal machine schedule under uncertainty is explored. As a solution approach, a two-stage stochastic programming method is used. For the solution of large-size problems, the harmony search algorithm is proposed, and its performance is compared with the exact solution approach. Finally, the value of the stochastic solution is assessed by comparing the results with the deterministic approach.



中文翻译:

一种单机调度问题的随机方法,以最小化总预期成本和依赖于客户的迟到成本

在注塑成型过程中,需要包含定位模具、清洁原料料斗和机器设置的设置。由于机组人员的技能水平和意外故障等随机因素,设置是不确定的。这个问题的一般版本被称为具有随机序列相关设置时间的单机调度问题。在这种特殊形式的问题中,目标函数被定义为最小化总预期成本,包括设置成本、迟到成本和提前成本。此外,还探讨了在不确定性下依赖于客户的迟到成本对最优机器调度的影响。作为一种解决方法,使用了两阶段随机规划方法。针对大尺寸问题的求解,提出了和声搜索算法,并将其性能与精确解法进行比较。最后,通过将结果与确定性方法进行比较来评估随机解决方案的价值。

更新日期:2021-05-02
down
wechat
bug