A note on makespan minimization in proportionate flow shops

Abstract

We consider two generalizations of the proportionate flow shop scheduling problem with the makespan objective. Each job has a processing requirement and each machine has a characteristic value. In our first (second) case we assume that the time a job occupies a machine is the maximum (minimum) of the processing requirement of the job and the characteristic… (More)
DOI: 10.1016/j.ipl.2010.10.016

Topics

4 Figures and Tables

Slides referencing similar topics