Dispatching rule-based scheduling algorithms in a single machine with sequence-dependent setup times and energy requirements

The research focuses on the problem of scheduling jobs in a single machine with sequence-dependent setup times and energy requirements in which jobs of multiple types arrive dynamically over time. A setup operation is required to change over the job types and it strongly depends on the sequence of the job types. During the setup operations, the machine tool is on idle state which means to consume an idle energy for non-machining on the machine tool. Moreover, frequent set-ups and long setup times negatively impact on the completion of the jobs as well as the idle energy consumption for the machine tool. Each job type has alternative process plans with different electricity machining energy requirements. The machining energy consumption which is incurred on the machine tool is defined from the perspective of the process plan. To cope with the dynamic nature of the scheduling problem, two energy efficient dispatching rule based algorithms are considered on the real time shop information with the objective of minimizing average energy consumption (with machining and non-machining) and mean tardiness of the finished jobs. The benefit coming from the adoption of suggested model has been addressed with reference to a real industrial use case study analyzed on the existing research. (C) 2015 The Authors. Published by Elsevier B.V.

Teti, R
Published in:
Research And Innovation In Manufacturing: Key Enabling Technologies For The Factories Of The Future - Proceedings Of The 48Th Cirp Conference On Manufacturing Systems, 41, 135-140
Presented at:
48th CIRP International Conference on Manufacturing Systems (CIRP CMS), Ischia, ITALY, JUN 24-26, 2015
Amsterdam, Elsevier Science Bv

 Record created 2016-10-18, last modified 2018-03-17

Rate this document:

Rate this document:
(Not yet reviewed)