Full text
| |
| Author(s): |
Emerson Carlos Colin
Total Authors: 1
|
| Document type: | Doctoral Thesis |
| Press: | São Paulo. |
| Institution: | Universidade de São Paulo (USP). Escola Politécnica (EP/BC) |
| Defense date: | 2000-03-31 |
| Examining board members: |
Tamio Shimizu;
Pedro Rodrigues Bueno Neto;
Carlos Eduardo Ferreira;
Miguel Cezar Santoro;
Horacio Hideki Yanasse
|
| Advisor: | Tamio Shimizu |
| Abstract | |
This thesis analyses two cases of one-machine problem regarding to production scheduling with fixed sequence. In both problems, modeling with mathematical programming, and (pseudo)polynomial-time algorithms are suggested. The first problem deals with idle time insertion in the problem where the objective function (represented by a sum of costs) considers that each job has costs described as any convex function of its completion time. The second problem considers earliness and tardiness with distinct costs for each job considering the possible use of additional capacity. For the additional capacity we assume that there are distinct costs for each time period where jobs can be processed. A procedure dealing with options of either to change the number of shifts or to utilize overtime considering total costs is suggested. Analysis and generalizations based on the utilization of several contiguous time periods with distinct costs and a heuristic extension for the multiple-machine case are also presented (AU) | |