Scheduling in Proportionate Flowshops - Robotics Institute Carnegie Mellon University

Scheduling in Proportionate Flowshops

R. V. Rachamadugu, A. Vepsalainen, and Thomas E. Morton
Tech. Report, CMU-RI-TR-83-10, Robotics Institute, Carnegie Mellon University, April, 1982
View Publication

Abstract

It is well known that except in the case of makespan problems, there are hardly any analytical results for flowshop problems. This paper considers of a class of flowshop problems where job processing time at a machine is proportionate to the processing time on the first machine. We show that for the pre-emptive version of the problem, in order to minimize any regular measure of performance, it is sufficient to consider permutation schedules. Also, results for various other measures are derived. A characterization of the optimal solution for the weighed tardiness problem is derived which is analogous to its counterpart in the single machine case. It is indicated as how this characterization may be used to develop heuristics for flowshop problems.

BibTeX

@techreport{Rachamadugu-1982-15120,
author = {R. V. Rachamadugu and A. Vepsalainen and Thomas E. Morton},
title = {Scheduling in Proportionate Flowshops},
year = {1982},
month = {April},
institute = {Carnegie Mellon University},
address = {Pittsburgh, PA},
number = {CMU-RI-TR-83-10},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.