Optimization Online


Flow shop scheduling with peak power consumption constraints

K. Fang (fang19***at***purdue.edu)
N. A. Uhan (nuhan***at***purdue.edu)
F. Zhao (fzhao***at***purdue.edu)
J. W. Sutherland (jwsuther***at***purdue.edu)

Abstract: We study scheduling as a means to address the increasing energy concerns in manufacturing enterprises. In particular, we consider a flow shop scheduling problem with a restriction on peak power consumption, in addition to the traditional time-based objectives. We investigate both mathematical programming and combinatorial approaches to this scheduling problem, and test our approaches with instances arising from the manufacturing of cast iron plates.

Keywords: scheduling, flow shop, energy, peak power consumption, integer programming, combinatorial optimization

Category 1: Applications -- OR and Management Sciences (Scheduling )

Category 2: Combinatorial Optimization

Category 3: Integer Programming

Citation: Annals of Operations Research, available online, January 2013. DOI: 10.1007/s10479-012-1294-z


Entry Submitted: 03/29/2012
Entry Accepted: 03/29/2012
Entry Last Modified: 01/25/2013

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society