Scheduling in Proportionate Flowshops.
CARNEGIE-MELLON UNIV PITTSBURGH PA ROBOTICS INST
Pagination or Media Count:
It is well known that except in the case of makespan problems, there are hardly and analytical results for flowshop problems. This paper considers of a class of flowshop problems where jobs processing time at a machine is proportionate to the processing time on the first machine. The authors show that for the pre-emptive version of the problem, in order to minimize and regular measure of performance, it is sufficient to consider permutation schedules. Also, results for various other measure are derived. A characterization of the optimal solution for the weighed tardiness problem is derived which is analogues to its counterpart in the single machine case. It is indicated as how this characterization may be used to develop heuristics for flowshop problems.
- Administration and Management
- Numerical Mathematics