Parallel machine scheduling problems in green manufacturing industry

Document Type

Article

Publication Date

1-1-2016

Abstract

Manufacturing companies are now more conscious about the environment. As such, there are more concerns in reducing the consumption of energy and the production of pollutants. Reduced consumption of energy will save cost, while reduction of pollutants will decrease the cost of cleaning up the environment. This paper considers scheduling problems that arise in green manufacturing companies. Suppose the manufacturing company has a set of parallel machines. Each machine has a cost per unit time that differs from machine to machine. The cost here is the sum of the energy cost and the clean up cost. A set of jobs is to be processed by these machines. Our goal is to find a schedule that minimizes the makespan (schedule length) or the total completion time, subject to the constraint that the total cost is not more than a given threshold value. We propose efficient heuristics and show, by computational experiments, that they perform very well in practice.

Identifier

84951768374 (Scopus)

Publication Title

Journal of Manufacturing Systems

External Full Text Location

https://doi.org/10.1016/j.jmsy.2015.11.006

ISSN

02786125

First Page

98

Last Page

106

Volume

38

Grant

71471052

Fund Ref

National Natural Science Foundation of China

This document is currently not available here.

Share

COinS