• 대한산업공학회지
• /
• 제32권2호
• /
• pp.98-103
• /
• 2006

In this research, the single machine capacitated lot-sizing and scheduling problem with sequence- dependent setup costs and setup times (CLSPSD) is considered. This problem is the extension of capacitated lot-sizing and scheduling problem (CLSP) with an additional assumption on sequence-dependent setup costs and setup times. The objective of the problem is minimizing the sum of production costs, inventory holding costs and setup costs satisfying customers' demands. It is known that the CLSPSD is NP-hard. In this paper, the MIP formulation is presented. To handle the problem more efficiently, a conceptual model is suggested, and one of the well-known meta-heuristics, the simulated annealing approach is applied. To illustrate the performance of this approach, various instances are tested and the results of this algorithm are compared with those of the CLPEX. Computational results show that this approach generates optimal or nearly optimal solutions.

• 산업경영시스템학회지
• /
• 제22권49호
• /
• pp.59-65
• /
• 1999

This paper considers the cell formation in a manufacturing environment where the setup times and costs are significantly dependent on the sequence. The trade-off between saving on the setup costs and additional investment on new machines is considered for determining the economic number of cells. Accordingly, This paper develops a mixed integer program and mentions a variety of manufacturing situations where this model can be useful. This paper also includes an illustrative example.

• 대한산업공학회지
• /
• 제19권2호
• /
• pp.65-74
• /
• 1993

In this paper, a two-echelon production-inventory model is developed which integrates the production scheduling problem of the multi-products produced on a single facility and the inventory problem of the related raw materials. The setup costs of the final products are assumed to be dependent on the production sequence. The aim is to determine simultaneously the production cycle time and the production sequence of the final products, and the procurement cycle times of the raw materials. For the model developed, a solution algorithm is suggested and illustrated with a numerical example. And the result is compared with those obtained by two separate subproblems.

• Management Science and Financial Engineering
• /
• 제18권1호
• /
• pp.1-12
• /
• 2012

In this paper, we report a case study on the common due-date assignment and scheduling problem in a paper remanufacturing system that produces corrugated cardboards using collected waste papers for a given set of orders under the make-to-order (MTO) environment. Since the system produces corrugated cardboards in an integrated process and has sequence-dependent setups, the problem considered here can be regarded as common due-date assignment and sequencing on a single machine with sequence-dependent setup times. The objective is to minimize the sum of the penalties associated with due-date assignment, earliness, and tardiness. In the study, the earliness and tardiness penalties were obtained from inventory holding and backorder costs, respectively. To solve the problem, we adopted two types of algorithms: (a) branch and bound algorithm that gives the optimal solutions; and (b) heuristic algorithms. Computational experiments were done on the data generated from the case and the results show that both types of algorithms work well for the case data. In particular, the branch and bound algorithm gave the optimal solutions quickly. However, it is recommended to use the heuristic algorithms for large-sized instances, especially when the solution time is very critical.

• 산업경영시스템학회지
• /
• 제35권3호
• /
• pp.77-86
• /
• 2012

We consider the capacitated lot-sizing and scheduling problem for a paper remanufacturing system that produces several types of corrugated cardboards. The problem is to determine the lot sizes as well as the sequence of lots for the objective of minimizing the sum of setup and inventory holding costs while satisfying the demand and the machine capacity over a given planning horizon. In particular, the paper remanufacturing system has sequence-dependent setup costs that depend on the type of product just completed and on the product to be processed. Also, the setup state at one period can be carried over to the next period. An integer programming model is presented to describe the problem. Due to the complexity of the problem, we modify the existing two-stage heuristics in which an initial solution is obtained and then it is improved using a multi-pass interchange method. To show the performances of the heuristics, computational experiments were done using the real data, and a significant amount of improvement is reported.