Scheduling in the context of manufacturing systems has become increasingly impor-
tant in order for organizations to achieve success in dynamic and competitive scenarios.
Scheduling can be described as allocation of available jobs over resources to meet the
performance criteria defined in a domain.
Our research work fo cuses on scheduling a given set of three-dimensional cylindrical
items, each characterized by width wj , height hj, and depth dj , onto parallel non-identical rectangular heat treatment kilns, such that the capacities of the kilns is optimally used. The problem is strongly NP-hard as it generalizes the (one-dimensional) Bin Packing Problem (1BP), in which a set of n positive values wj has to be partitioned into the minimum number of subsets so that the total value in each subset does not exceed the bin capacity W. The problem has been formulated as a variant of the 3D-BPP
by following the MILP approach, and we propose a weight optimization heuristic that
produces solutions comparable to that of the LP problem, in addition to reducing the
computational complexity.
Finally, we also propose a Decomposition Algorithm (DA) and validate the perfor-
mance effectiveness of our heuristic. The numerical analyses provides useful insights that influence the shop-floor decision making process.
| Identifer | oai:union.ndltd.org:IISc/oai:etd.ncsi.iisc.ernet.in:2005/541 |
| Date | 02 1900 |
| Creators | Srinidhi, S |
| Contributors | Raghavan, N R Srinivasa |
| Source Sets | India Institute of Science |
| Language | en_US |
| Detected Language | English |
| Type | Thesis |
| Relation | G20955 |
Page generated in 0.0019 seconds