Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4949059 | Robotics and Computer-Integrated Manufacturing | 2017 | 6 Pages |
Abstract
Most previous studies on machining optimization focused on aspects related to machining efficiency and economics, without accounting for environmental considerations. Higher cutting speed is usually desirable to maximize machining productivity, but this requires a high power load peak. In Taiwan, electricity prices rise sharply if instantaneous power demand exceeds contract capacity. Many studies over the previous decades have examined production scheduling problems. However, most such studies focused on well-defined jobs with known processing times. In addition, traditional sequencing and scheduling models focus primarily on economic objectives and largely disregard environmental issues raised by production scheduling problems. This study investigates a parallel machine scheduling problem for a manufacturing system with a bounded power demand peak. The challenge is to simultaneously determine proper cutting conditions for various jobs and assign them to machines for processing under the condition that power consumption never exceed the electricity load limit. A two-stage heuristic approach is proposed to solve the parallel machine scheduling problem with the goal of minimizing makespan. The heuristic performance is tested by distributing 20 jobs over 3 machines with four possible cutting parameter settings.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Yi-Chi Wang, Ming-Jun Wang, Sung-Chi Lin,