Robust identical parallel machine scheduling with two-stage time-of-use tariff and not-all-machine option.
Saved in:
| Title: | Robust identical parallel machine scheduling with two-stage time-of-use tariff and not-all-machine option. |
|---|---|
| Authors: | Feng, Xin1 (AUTHOR), Peng, Hongjun1 (AUTHOR) penghj@njfu.edu.cn |
| Source: | International Journal of Production Research. Jan2024, Vol. 62 Issue 1/2, p380-403. 24p. |
| Subjects: | Tariff, Scheduling, Machinery, Robust optimization, Energy consumption, Distribution planning |
| Abstract: | Time-of-use (TOU) tariff has been implemented in the manufacturing industry to improve energy efficiency by regulating the electricity imbalance between supply and demand. Besides, not-all-machine (NAM) option is another way of energy-saving by using only a subset of all the available machines. This study investigates a robust identical parallel machine scheduling problem with a two-stage TOU tariff and NAM option. Only interval bounds on job processing times are known. The problem is first formulated into a min–max regret model to maximise the robustness. Based on problem properties, both an iterative relaxation-based exact algorithm and a memetic differential evolution-based heuristic are developed to solve the problem. Computational experiments on 240 randomly generated instances with up to 20 jobs are conducted to evaluate the performance of the developed methods. Besides, 900 large-sized randomly generated instances with up to 150 jobs are tested for sensitivity analysis and to identify managerial insights for achieving energy-efficient schedules. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | Time-of-use (TOU) tariff has been implemented in the manufacturing industry to improve energy efficiency by regulating the electricity imbalance between supply and demand. Besides, not-all-machine (NAM) option is another way of energy-saving by using only a subset of all the available machines. This study investigates a robust identical parallel machine scheduling problem with a two-stage TOU tariff and NAM option. Only interval bounds on job processing times are known. The problem is first formulated into a min–max regret model to maximise the robustness. Based on problem properties, both an iterative relaxation-based exact algorithm and a memetic differential evolution-based heuristic are developed to solve the problem. Computational experiments on 240 randomly generated instances with up to 20 jobs are conducted to evaluate the performance of the developed methods. Besides, 900 large-sized randomly generated instances with up to 150 jobs are tested for sensitivity analysis and to identify managerial insights for achieving energy-efficient schedules. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 00207543 |
| DOI: | 10.1080/00207543.2023.2228922 |
