Scheduling Unrelated Parallel Batch Processing Machines Under Time-of-Use Electricity Prices
Authors:
- 26 February 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 1631-1646
Abstract
The increasing energy consumption of manufacturing companies has placed a lot of pressure on the power grid. To alleviate the pressure and flatten the demand peaks over a day, time-of-use electricity pricing scheme has been widely adopted around the world, which provides an opportunity for manufacturers to reduce their energy costs by avoiding production during peak hours. In this study, we investigate the unrelated parallel batch processing machine scheduling under time-of-use electricity prices. The objective is to minimize the total electricity cost while ensuring that the makespan does not exceed a predetermined deadline. To address this problem, we propose a novel mixed integer linear programming formulation along with several valid cuts. Moreover, the Dantzig-Wolfe decomposition technique is utilized to reformulate this problem, and a branch and price algorithm is developed to deal with large-scale instances. Extensive numerical experiments demonstrate the superiority of our new formulation compared to existing formulations. Furthermore, the inclusion of valid cuts can significantly improve the efficiency of both the existing and proposed formulations. And our branch and price algorithm can efficiently solve instances with 200 jobs with an average gap of less than 3% in 30 minutes. Note to Practitioners —As an efficient production method, parallel batch processing is widely used in many manufacturing scenarios, such as the burn-in operation in semiconductor manufacturing, the hardening operation in aircraft industry, and the glass ceramization operation. The workpieces are usually processed in a high temperature and high-pressure environment for hours in these scenarios, and the energy consumption cost is relatively high. In recent years, time-of-use pricing scheme has been widely adopted around the world to rebalance the energy demand, which provides manufacturers with great opportunities to save their energy consumption costs. In this paper, we investigate how to optimize the electricity cost under time-of-use prices in a parallel batch processing machine environment. An efficient time-interval-indexed mixed integer linear programming formulation and a branch and price algorithm are proposed to solve this problem. The proposed algorithm can provide high-quality solutions for real-world-scale instances within a reasonable time limit. We also analyze the performances of different methods under various situations to help the practitioners choose the most suitable method.Keywords
Funding Information
- National Natural Science Foundation of China (72188101)
This publication has 38 references indexed in Scilit:
- Arc-flow approach for single batch-processing machine schedulingComputers & Operations Research, 2021
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow timeEuropean Journal of Operational Research, 2020
- Exact algorithms to minimize makespan on single and parallel batch processing machinesEuropean Journal of Operational Research, 2020
- Large-scale energy-conscious bi-objective single-machine batch scheduling under time-of-use electricity tariffs via effective iterative heuristicsAnnals of Operations Research, 2019
- A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption costComputers & Operations Research, 2018
- Bi-criteria ant colony optimization algorithm for minimizing makespan and energy consumption on parallel batch machinesApplied Soft Computing, 2017
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready timesComputers & Operations Research, 2017
- Scheduling on a single machine under time-of-use electricity tariffsAnnals of Operations Research, 2015
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizesComputers & Operations Research, 2010
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizesComputers & Operations Research, 2008