Scheduling on a two-machine permutation flow shop under time-of-use electricity tariffs

Wang Shijin; Zhu Zhanguo; Fang Kan; Chu Feng; Chu Chengbin

首页> 外文期刊>International Journal of Production Research >Scheduling on a two-machine permutation flow shop under time-of-use electricity tariffs

【24h】

Scheduling on a two-machine permutation flow shop under time-of-use electricity tariffs

机译：使用分时电价的两机置换流水车间调度

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

We consider a two-machine permutation flow shop scheduling problem to minimise the total electricity cost of processing jobs under time-of-use electricity tariffs. We formulate the problem as a mixed integer linear programming, then we design two heuristic algorithms based on Johnson's rule and dynamic programming method, respectively. In particular, we show how to find an optimal schedule using dynamic programming when the processing sequence is fixed. In addition, we propose an iterated local search algorithm to solve the problem with problem-tailored procedures and move operators, and test the computational performance of these methods on randomly generated instances.

机译：我们考虑了两台机器排列的流水车间调度问题，以最大程度地减少使用时间电价下处理工作的总电费。我们将问题表述为混合整数线性规划，然后分别基于Johnson规则和动态规划方法设计了两种启发式算法。特别是，我们展示了当处理顺序固定时如何使用动态编程找到最佳计划。此外，我们提出了一种迭代局部搜索算法，以解决问题量身定制的过程和移动算子的问题，并在随机生成的实例上测试这些方法的计算性能。

著录项

来源
《International Journal of Production Research》 |2018年第10期|3173-3187|共15页
作者
Wang Shijin; Zhu Zhanguo; Fang Kan; Chu Feng; Chu Chengbin;
展开▼
作者单位

Tongji Univ, Sch Econ & Management, Shanghai, Peoples R China;

Nanjing Agr Univ, Coll Econ & Management, Nanjing, Jiangsu, Peoples R China;

Tianjin Univ, Coll Management & Econ, Tianjin, Peoples R China;

Univ Evry Val dEssonne, Lab IBISC, Evry, France;

Tongji Univ, Sch Econ & Management, Shanghai, Peoples R China;

展开▼
收录信息美国《科学引文索引》(SCI);美国《工程索引》(EI);
原文格式 PDF
正文语种 eng
中图分类
关键词
scheduling; flow shop; electricity cost; dynamic programming; iterated local search;

机译：调度;流水车间;电费;动态规划;迭代局部搜索;

相似文献

外文文献
中文文献
专利

1. Electricity cost minimisation for optimal makespan solution in flow shop scheduling under time-of-use tariffs [J] . Minh Hung Ho, Hnaien Faicel, Dugardin Frederic International Journal of Production Research . 2021,第3a4期

机译：在使用时间关税下流店调度中最佳Mapspan解决方案的电力成本最小化
2. Bi-Objective Re-Entrant Hybrid Flow Shop Scheduling considering Energy Consumption Cost under Time-of-Use Electricity Tariffs [J] . Kaifeng Geng, Chunming Ye, Zhen hua Dai, Complexity . 2020,第1期

机译：双目标再参赛混合流量流动店调度考虑在使用时的电力关税下的能耗成本
3. A TWO-STAGE GREEDY HEURISTIC FOR A FLOWSHOP SCHEDULING PROBLEM UNDER TIME-OF-USE ELECTRICITY TARIFFS [J] . Pilerood A. E., Heydari M., Mazdeh M. M. South African Journal of Industrial Engineering . 2018,第1期

机译：分时段用电调度的两阶段贪婪启发式调度问题
4. Permutation flow shop scheduling with delay time under time-of-use electricity tariffs [C] . Xingrui Cheng, Feng Gao, Chaobo Yan, World Congress on Intelligent Control and Automation . 2016

机译：在使用时电价下具有延迟时间的置换流水车间调度
5. Optimal lot streaming and scheduling of multiple jobs in two-machine no-wait flow shops [D] . Li, Ming 2002

机译：两机无等待流水车间中的最佳作业流和多个作业的调度
6. Intelligent Decision-Making of Scheduling for Dynamic Permutation Flowshop via Deep Reinforcement Learning [O] . Shengluo Yang, Zhigang Xu, Junyi Wang 2021

机译：通过深度加强学习来调度动态排列流程的智能决策
7. A TWO-STAGE GREEDY HEURISTIC FOR A FLOWSHOP SCHEDULING PROBLEM UNDER TIME-OF-USE ELECTRICITY TARIFFS [O] . Amir Ebrahimzadeh Pilerood, Mehdi Heydari, Mohammad Mahdavi Mazdeh 2018

机译：在使用时间电费下的流动调度问题的两阶段贪婪的启发式
8. Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of SpecialCases [R] . Hoogeveen, J. A., Kawaguchi, T. 1996

机译：最小化双机Flowshop的总完工时间：特殊情况分析

Scheduling on a two-machine permutation flow shop under time-of-use electricity tariffs

摘要

著录项

相似文献

相关主题

期刊订阅