首页> 美国卫生研究院文献>Data in Brief >Datasets for lot sizing and scheduling problems in the fruit-based beverage production process
【2h】

Datasets for lot sizing and scheduling problems in the fruit-based beverage production process

机译:基于果实饮料生产过程中的批判和调度问题的数据集

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

The datasets presented here were partially used in “Formulation and MIP-heuristics for the lot sizing and scheduling problem with temporal cleanings” (Toscano, A.,  Ferreira, D., Morabito, R., Computers & Chemical Engineering) [1], in “A decomposition heuristic to solve the two-stage lot sizing and scheduling problem with temporal cleaning” (Toscano, A., Ferreira, D., Morabito, R., Flexible Services and Manufacturing Journal) [2], and in “A heuristic approach to optimize the production scheduling of fruit-based beverages” (Toscano et al., Gestão & Produção, 2020) [3]. In fruit-based production processes, there are two production stages: preparation tanks and production lines. This production process has some process-specific characteristics, such as temporal cleanings and synchrony between the two production stages, which make optimized production planning and scheduling even more difficult. Thus, some papers in the literature have proposed different methods to solve this problem. To the best of our knowledge, there are no standard datasets used by researchers in the literature to verify the accuracy and performance of proposed methods or to be a benchmark for other researchers considering this problem. The authors have been using small data sets that do not satisfactorily represent different scenarios of production. Since the demand in the beverage sector is seasonal, a wide range of scenarios enables us to evaluate the effectiveness of the proposed methods in the scientific literature in solving real scenarios of the problem. The datasets presented here include data based on real data collected from five beverage companies. We presented four datasets that are specifically constructed assuming a scenario of restricted capacity and balanced costs.
机译:这里呈现的数据集部分用于“具有时间清洁的批量和调度问题的制定和MIP-heuRistics”(Toscano,A.,Ferreira,D.,Morabito,R.,计算机和化学工程)[1],在“用时间清洁解决两级尺寸调度和调度问题的分解启发式”(Toscano,A.,Ferreira,D.,Morabito,R.,柔性服务和制造期刊)[2],并在“a优化水果饮料生产调度的启发式方法“(Toscano等,Gestão&Produção,2020)[3]。在基于水果的生产过程中,有两种生产阶段:准备罐和生产线。该生产过程具有一些过程特定特性,如两种生产阶段之间的时间清洁和同步,这使得优化的生产计划和调度更加困难。因此,文献中的一些论文已经提出了解决这个问题的不同方法。据我们所知,文献中的研究人员没有使用标准数据集来验证所提出的方法的准确性和性能,或者考虑到这一问题的其他研究人员的基准。作者一直在使用不令人满意地代表不同的生产方案的小数据集。由于饮料行业的需求是季节性的,因此广泛的情景使我们能够评估拟议方法在科学文献中解决问题的实际情况的有效性。这里呈现的数据集包括基于从五个饮料公司收集的实际数据的数据。我们介绍了四个数据集,具体构造,假设有限的容量和平衡成本的场景。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号