Journal of Applied Mathematics

Volume 2013 (2013), Article ID 216595, 9 pages

http://dx.doi.org/10.1155/2013/216595

## Integration of Lot Sizing and Flow Shop Scheduling with Lot Streaming

Department of Mechanical and Manufacturing Engineering, Universiti Putra Malaysia, 43400 Serdang, Selangor, Malaysia

Received 26 May 2013; Revised 15 September 2013; Accepted 2 October 2013

Academic Editor: Yuri Sotskov

Copyright © 2013 Navid Mortezaei and Norzima Zulkifli. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

We will develop a mathematical model for the integration of lot sizing and flow shop scheduling with lot streaming. We will develop a mixed-integer linear model for multiple products lot sizing and lot streaming problems. Mixed-integer programming formulation is presented which will enable the user to find optimal production quantities, optimal inventory levels, optimal sublot sizes, and optimal sequence simultaneously. We will use numerical example to show practicality of the proposed model. We test eight different lot streaming problems: (1) consistent sublots with intermingling, (2) consistent sublots and no intermingling between sublots of the products (without intermingling), (3) equal sublots with intermingling, (4) equal sublots without intermingling, (5) no-wait consistent sublots with intermingling, (6) no-wait equal sublots with intermingling, (7) no-wait consistent sublots without intermingling, and (8) no-wait equal sublots without intermingling. We showed that the best makespan can be achieved through the consistent sublots with intermingling case.

#### 1. Introduction

In the manufacturing industries, the commonly used planning and scheduling decision-making strategy generally follows a hierarchical approach, in which the planning problem is solved first to define the production targets, and the scheduling problem is solved next to meet these targets [1]. However, this traditional strategy presents a great disadvantage, since there is no interaction between the two decision levels; that is, the planning decisions generated might cause infeasible scheduling subproblems [1]. Since the production planning model ignores detailed scheduling constraints, there is no guarantee that a feasible production schedule exists for the generated production plan. Typically, when infeasibilities are discovered, ad hoc adjustments are made within the production plan [2]. Therefore, it is necessary to develop methodologies that can effectively integrate production planning and scheduling. Potts and Van Wassenhove [3] reviewed studies in which either batching or lotsizing decisions along with scheduling decisions were made, and they concluded that not much research has been conducted in this area. We summarize some works of research regarding integration of lot sizing and flow shop scheduling as follows. Riane et al. [4] considered production planning and scheduling simultaneously in hybrid flow shop organizations (also called flexible flow shop). The solution approach adapted in their paper was “divide and conquer,” consisting of decomposing the problem into a loading problem, a batching problem, and a scheduling problem. Yan et al. [5] developed an integrated production planning and scheduling model for automobile assembly lines. In this case, hierarchical production planning approaches have been used to decompose monthly or weekly plans into day or shift plans. They solved first production planning model and then solved the scheduling problem by dispatching rules (EDD and smallest lots); if there are not feasible solutions, the neighbors plan and neighbor schedule definitions will be used to find feasible initial solutions [5]. They proposed three tabu search algorithms that explore solution spaces for both problems and found a combination of a production plan and schedule that are feasible and that approximately optimize the objective function. Palaniappan and Jawahar [6] developed a model for simultaneous optimization of lot sizing and scheduling in a flow line assembly. Procurement lot sizing and production scheduling are considered to be the two critical factors in controlling the cost of production in those units. The simultaneous optimization of procurement lot sizing and the assembly scheduling offer many benefits. Palaniappan and Jawahar [6] claimed that only a little consideration is given to set up time-dependent production systems with order backlog. Therefore, an integrated cost model including setup time dependency and order backlog was developed to handle both procurement lot sizing and production scheduling simultaneously. They proposed a genetic algorithm (GA) based heuristic to create an optimal or near-optimal solution for the flow line assembly problem under the setup-dependent environment [6]. The objective of their model was the minimization of total cost, which includes assembly, switchover, procurement, inventory, and order backlog/shortage costs. Yan and Zhang [7] developed an integrated model for production planning and scheduling in a three-stage manufacturing system (full-space method). They claimed that most of the literature focuses on the master production schedule (MPS) and capacity requirement planning (CRP) in a manufacturing resource planning (MRPII) environment, while the scheduling problem is seldom considered [7]. Since these methods keep planning separate from scheduling, they often generate an infeasible production plan which has to be modified to obtain feasible schedule because it did not consider the details of the scheduling problem [7]. Considering production planning and scheduling simultaneously is advisable to avoid an infeasible solution. Also, Yan and Zhang claimed that none of the existing literature involves a monolithic optimization model for production planning and scheduling in a multistage system. They formulated a monolithic optimization model for a three-stage manufacturing system that includes a job shop, a parallel flow shop, and a single machine shop. Ng et al. [8] and Matsveichuk et al. [9] considered flow shop scheduling problems with interval processing times. However, none of the previous scholars considered the lot streaming problem within their models.

Lundrigan [10] summarized nine rules of optimized production technology (OPT), among which the seventh rule states that a transfer batch (i.e., a sublot) may not, and often should not, be equal to a processing batch (i.e., a lot). Clearly, lot streaming is a technique for splitting jobs, each consisting of identical items, into sublots to allow their overlapping on successive machines in multistage production systems. In this way, production can be accelerated, and a remarkable reduction of makespan and improved timeliness are within reach [11]. Generally, the goal in lot streaming is to determine the number of sublots for each product, the size of each sublot, and the sequence for processing the sublots so that a given objective is optimized [12, 13]. The following terms summarize different directions of lot streaming research; see Feldmann and Biskup [12], Kalir and Sarin [14], Sarin and Jaiprakash [15], and Zhang et al. [13].

*Single Product/Multiple Products*. Either a single product or multiple products are considered.

*Fixed/Equal/Consistent/Variable Sublots*. Fixed sublots mean that all sublots for all products consist of an identical number of items on all stages. Equal sublots refer to the case when all the sublots of a lot are of the same size. When identical sublot sizes are used to transfer a lot between every pair of consecutive machines, the sublots are termed consistent. However, if the sublot sizes used for transferring a lot among the machines vary, the sublots are called variable [12, 14].

*Discrete/Continuous Sublots*. The sublots of a lot are, in general, assumed to take real-valued (continuous) sizes. However, integer sublot sizes are more relevant for the manufacturing facilities involved in the production of discrete parts [13, 14]. Examples for both cases include books, cars, and furniture, which require integer variables, while for the production (not the sizing) of gas, beverages, concrete, electricity, and so forth real variables are appropriate [12].

*Non-Idling/Intermitted Idling*. No idling refers to the situation where no idle time is permitted between the processing of the sublots of a lot on a machine. Under intermittent idling, an idle time may be present between the processing of two successive sublots of a lot on a machine [15].

*No-Wait/Wait Schedules*. In a no-wait flow shop, each sublot of a lot is processed continuously on all the machines. This could lead to an inserted idle time before the processing of a sublot of a lot on a machine. In a wait schedule, a sublot may wait for processing between consecutive stages [15].

*Attached Setups/Detached Setups/No Setups*. If attached setups are needed, the setup cannot begin until the sublot is available at the particular stage. In a detached setup, the setup is independent from the availability of the sublot. Sometimes, setup times are neglected or do not occur [14].

*Intermingling/Nonintermingling Sublots*. If, in a multiproduct setting, intermingling sublots are allowed, the sequence of sublots of product may be interrupted by sublots of product . For nonintermingling sublots, no interruption in the sequence of sublots of a product is allowed [12].

In the following section, we summarize research on lot streaming problems and focus on the flow shop environment.

Trietsch and Baker [16] developed a linear formulation for a single product lot streaming problem with consistent sublots. Biskup and Feldmann [17] presented the first integer programming formulation for the single product lot streaming problem with variable sublots. Chang and Chiu [18] and Chui et al. [19] show the diminishing marginal effect of lot streaming. They found that, under the same sublot type, although increasing number of sublots will reduce makespan, the marginal reduction in makespan will decrease with the increase of the number of sublots. For the flow shop, Potts and Baker [20] used a simple two-machine numerical example to show that, in the intermingled case, an optimal solution generally cannot be found when the sequencing approach and the splitting approach are used independently. They suggested that the two approaches should be used simultaneously. Glass and Possani [21] indicated that, for jobs with identical processing times and number of sublots, no advantage is obtained by allowing inconsistency in sublot sizing of consecutive jobs. Feldmann and Biskup [12] developed a mathematical model for multiproduct lot streaming problem. They revealed that the benefit of lot streaming in multistage settings increases not only with the number of sublots but also with a growing number of stages. Tseng and Liao [22] proposed a swarm optimization procedure not only for the flow shop environment, but also for minimizing total weighted tardiness and earliness, with equally sized sublots. Marimuthu et al. [23] suggested an evolutionary algorithm approach for the multimachine lot streaming problem to minimize the total flow time and makespan with set-up times. However, all lot streaming research assumes that the number of identical items of the product on each machine is given in advance. In other words, the lot sizing problem is not integrated into lot streaming problem. In this research, we will develop a mixed-integer linear mathematical model for the integration of lot sizing and scheduling with lot streaming problem. This model can be used in medium to high volume systems such as autos, personal computers, radios and televisions, and furniture. This paper is organized as follows: Section 2 introduces the problem and develops a mathematical formulation for this problem. Implementation of this model (through an example) is given in Section 3. Finally, Section 4 gives some conclusions and suggestions for further studies.

#### 2. Integrated Model for Lot Sizing and Scheduling with Lot Streaming

Brucker et al. revealed that there exists a polynomial algorithm for any regular optimization criterion in the case of two jobs while the problem with three jobs is *NP*-hard for any criterion traditionally considered in scheduling theory [24]. Therefore, the problem under consideration certainly is *NP*-hard. With the following model formulation, generally speaking, the four inherent goals of the problem, namely, determining the sequence among the sublots, the size of the each lot, inventory levels, and the size of the individual sublots, are solved simultaneously. The model assumptions are as follows.(1)All lots are available at time zero.(2)The machine configuration considered constitutes a flow shop.(3)Any breakdowns and scheduled maintenance are not allowed.(4)Set-up times between operations are negligible or include processing times.(5)There are no precedence constraints among the products.(6) distinct final products are produced by the shop.(7)The demand is always satisfied (no backlogging).(8)There is an external demand for finished products (processed by last machine).(9)All machines have capacity constraints.(10)Planning horizon is a single period (i.e., a day).(11)All programming parameters are deterministic and there is no randomness.(12)An idle time may be present between the processing of two successive sublots of a lot on a machine (intermittent idling).(13)Consistent and equal sublots are considered (no variable sublots).(14)The number of sublots for all lots is known in advance.

This problem with above-mentioned assumptions can be formulated as follows.

*Indices* : the number of products, : the number of nonidentical machines, : the number of sublots, , : indices for products , , : denotes th machine , , : indices for sublots , .

*Decision Variables* : binary variable, which takes the value 1 if sublot of product is sequenced prior to sublot of product , 0 otherwise, : completion time of sublot of product on machine , : quantity of product produced in machine , : stock of product after operation in machine , : maximum completion time on machine (makespan), : sublot size of th sublot of product on machine .

*Parameters and Constants* : beginning inventory of product on machine , : production cost of product in machine , : holding cost of product , : available capacity of machine (measured in time units), : external demand for product at the end of period (a day), : processing time for one unit of product on machine , : is used to convert the makespan into a cost (cost per unit time), : large number.

Consider, The objective function (expression (1)) minimizes the sum of production costs, holding costs, and makespan costs. Constraints (2) represent the inventory balances. Constraints (3) ensure that the production time of each machine does not exceed its available capacity. In (4), the maximum of completion time of sublots on the last machine is used to define the makespan . Restrictions (5) ensure that in sum items are produced from product on machine . Constraints (6) ensure that sublots type is consistent. Constraints (7) and (8) ensure that the sublots of the same products do not overlap. Since intermingling is allowed, constraints (9) and (10) determine the sequence of sublots. No machine index is needed for binary variable in permutation flow shop. Restrictions (11) ensure that any sublot of any job begins processing on machine 1 after time zero. By replacing inequality constraint (7) with equality, the formulation can be adapted to case of no-wait flow shop. The previous formulation from (1) to (12) is for consistent sublots type. By adding (13), previous mathematical model can be adapted to equal sublots type. Consider The number of binary variables required can be calculated by .

##### 2.1. No Intermingling between the Sublots of One (or More) of the Products with the Other Products

This setting might be advantageous if the setup costs for one or more products are high. A quick approach for this setting is to use the model formulations (1) to (12) and equate the binary variables for the sublots of the product(s) that is (are) not allowed to intermingle. If all products are not allowed to intermingle, for a three-product example, this would be

#### 3. Numerical Example

In order to measure this model’s performance, we use the model to test the following randomly generated problem: we have three types of products being processed on four machines. The number of sublots per product is three. Demands are 20, 20, and 15 for products 1 to 3, respectively. Production costs are 10, 15, and 12 for products 1 to 3, respectively. Holding costs are 3, 4, and 3 for products 1 to 3. The maximum available capacity of machines is 400 time units for machines 1 to 4. The beginning inventory is zero. Cost per unit time is equal to 5. Table 1 summarizes the processing times of products on machines. The example has been solved using LINGO 12.0, a commercially available optimization software program, on a laptop computer with Intel core i5 2410m processor 2.3 GHz with 4 GB of RAM.

##### 3.1. Results of the Problem

LINGO solver defined the model of example as a mixed-integer linear problem (MILP) and used the branch and bound (B-and-B) method to solve it. The resulting formulation has a total of 169 variables and 691 constraints for consistent sublots with intermingling case. The solution was achieved after running the solver for 146 seconds. The results of the consistent sublots with intermingling case are as follows. Total costs are 3570, and makespan is equal to 170. Sublot sizes are as follows: , , , , , , , 4, and . Product quantities are 20 and , with all inventory level or . Table 2 summarizes the completion times of each sublot. Figure 1 demonstrated the Gantt chart of this problem. The makespan is equal to total idle time on the last machine plus total processing time on the last machine [16]. For this example, in consistent sublots with intermingling setting, as demonstrated in Figure 1, makespan is equal to total idle time on machine number four which is 65 minutes plus total processing time on machine number four or 105 minutes, which will be equal to 170 minutes. Now, we solve this example for 8 different kinds of problems as follows: consistent sublots with intermingling, consistent sublots and no intermingling between sublots of the products (without intermingling), equal sublots with intermingling, equal sublots without intermingling, no-wait consistent sublots with intermingling, no-wait equal sublots with intermingling, no-wait consistent sublots without intermingling, and no-wait equal sublots without intermingling. Tables 3, 4 and 5 summarized the results of these eight different lot streaming problems.

Columns 5 and 6 of Table 5 are achieved with the following formulations. and the best makespan are 3570 and 170 which belong to consistent sublots with intermingling case. Comparison of total costs can be computed through and comparison of make spans can be computed through .

For instance, the makespan of consistent sublots with intermingling case is 11% better than makespan of consistent sublots without intermingling case. In equal sublots with and without intermingling cases, the production quantity and inventory will be , , and and , , and , which causes additional costs. Therefore, in equal sublots cases, the increase in objective function (total cost) is not only due to the increase in makespan but also due to the increase in production quantity and inventory.

Figures 2, 3, and 4 are Gantt charts of these problems. Optimal sequence for schedule without lot streaming is 1-2-3 and the makespan is 2-4-5 (achieved through Johnson rules (SPT) [25]). The percentage of makespan reduction due to lot streaming in permutation flow shop is 30% (compared to the best makespan).

#### 4. Conclusion

In this research, we developed the first mathematical model for integration of lot sizing and flow shop scheduling with lot streaming. We developed a mixed-integer linear model for multiple products lot sizing and lot streaming problems. Mixed-integer programming formulation was presented which enabled the user to find optimal production quantities, optimal inventory levels, and optimal sublot sizes, as well as optimal sequence simultaneously. We used a numerical example to show the practicality of the proposed model. We tested eight different lot streaming problems: consistent sublots with intermingling, consistent sublots and no intermingling between sublots of the products (without intermingling), equal sublots with intermingling, equal sublots without intermingling, no-wait consistent sublots with intermingling, no-wait equal sublots with intermingling, no-wait consistent sublots without intermingling, and no-wait equal sublots without intermingling. We showed that the best makespan can be achieved through the case of consistent sublots with intermingling. Since the increase in the number of binary variables and integrality restrictions, typically, make a lot streaming problem difficult to solve, the use of metaheuristic methods to deal with large-scale problems deserves further study. The proposed model is adapted to consistent and equal sublot types. Extension of this model for variable sublot type could be another topic for further studies.

#### Conflict of Interests

The authors certify that there is no conflict of interests (considering both financial and nonfinancial gains) with any organization regarding the material discussed in the paper.

#### Acknowledgment

The authors would like to thank the anonymous referees for their invaluable comments and suggestions on an earlier draft of this paper.

#### References

- Z. Li and M. G. Ierapetritou, “Production planning and scheduling integration through augmented lagrangian optimization,”
*Computers & Chemical Engineering*, vol. 34, no. 6, pp. 996–1006, 2010. View at Publisher · View at Google Scholar · View at Scopus - J. Lasserre, “An integrated model for job-shop planning and scheduling,”
*Management Science*, vol. 38, no. 8, pp. 1201–1211, 1992. View at Google Scholar - C. N. Potts and L. N. Van Wassenhove, “Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity,”
*Journal of the Operational Research Society*, vol. 43, no. 5, pp. 395–406, 1992. View at Google Scholar - F. Riane, A. Artiba, and S. Iassinovski, “An integrated production planning and scheduling system for hybrid flowshop organizations,”
*International Journal of Production Economics*, vol. 74, no. 1–3, pp. 33–48, 2001. View at Publisher · View at Google Scholar · View at Scopus - H.-S. Yan, Q.-F. Xia, M.-R. Zhu, X.-L. Liu, and Z.-M. Guo, “Integrated production planning and scheduling on automobile assembly lines,”
*IIE Transactions*, vol. 35, no. 8, pp. 711–725, 2003. View at Publisher · View at Google Scholar · View at Scopus - P. K. Palaniappan and N. Jawahar, “A genetic algorithm for simultaneous optimisation of lot sizing and scheduling in a flow line assembly,”
*International Journal of Production Research*, vol. 49, no. 2, pp. 375–400, 2011. View at Publisher · View at Google Scholar · View at Scopus - H.-S. Yan and X.-D. Zhang, “A case study on integrated production planning and scheduling in a three-stage manufacturing system,”
*IEEE Transactions on Automation Science and Engineering*, vol. 4, no. 1, pp. 86–92, 2007. View at Publisher · View at Google Scholar · View at Scopus - C. T. Ng, N. M. Matsveichuk, Y. N. Sotskov, and T. C. E. Cheng, “Two-machine flow-shop minimum-length scheduling with interval processing times,”
*Asia-Pacific Journal of Operational Research*, vol. 26, no. 6, pp. 715–734, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - N. M. Matsveichuk, Y. N. Sotskov, and F. Werner, “The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times,”
*Optimization*, vol. 60, no. 12, pp. 1493–1517, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - R. Lundrigan, “What is this thing called OPT?”
*Production and Inventory Management*, vol. 27, no. 2, pp. 2–11, 1986. View at Google Scholar · View at Scopus - A. A. Kalir and S. C. Sarin, “Evaluation of the potential benefits of lot streaming in flow-shop systems,”
*International Journal of Production Economics*, vol. 66, no. 2, pp. 131–142, 2000. View at Publisher · View at Google Scholar · View at Scopus - M. Feldmann and D. Biskup, “Lot streaming in a multiple product permutation flow shop with intermingling,”
*International Journal of Production Research*, vol. 46, no. 1, pp. 197–216, 2008. View at Publisher · View at Google Scholar · View at Scopus - W. Zhang, C. Yin, J. Liu, and R. J. Linn, “Multi-job lot streaming to minimize the mean completion time in m-1 hybrid flowshops,”
*International Journal of Production Economics*, vol. 96, no. 2, pp. 189–200, 2005. View at Publisher · View at Google Scholar · View at Scopus - A. A. Kalir and S. C. Sarin, “Constructing near optimal schedules for the flow-shop lot streaming problem with sublot-attached setups,”
*Journal of Combinatorial Optimization*, vol. 7, no. 1, pp. 23–44, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - S. C. Sarin and P. Jaiprakash,
*Flow Shop Lot Streaming Problems*, Springer, New York, NY, USA, 2007. - D. Trietsch and K. R. Baker, “Basic techniques for lot streaming,”
*Operations Research*, vol. 41, no. 6, pp. 1065–1076, 1993. View at Google Scholar - D. Biskup and M. Feldmann, “Lot streaming with variable sublots: an integer programming formulation,”
*Journal of the Operational Research Society*, vol. 57, no. 3, pp. 296–303, 2006. View at Publisher · View at Google Scholar · View at Scopus - J. H. Chang and H. N. Chiu, “A comprehensive review of lot streaming,”
*International Journal of Production Research*, vol. 43, no. 8, pp. 1515–1536, 2005. View at Publisher · View at Google Scholar · View at Scopus - H.-N. Chiu, J.-H. Chang, and C.-H. Lee, “Lot streaming models with a limited number of capacitated transporters in multistage batch production systems,”
*Computers & Operations Research*, vol. 31, no. 12, pp. 2003–2020, 2004. View at Publisher · View at Google Scholar · View at Scopus - C. N. Potts and K. R. Baker, “Flow shop scheduling with lot streaming,”
*Operations Research Letters*, vol. 8, no. 6, pp. 297–303, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - C. A. Glass and E. Possani, “Lot streaming multiple jobs in a flow shop,”
*International Journal of Production Research*, vol. 49, no. 9, pp. 2669–2681, 2011. View at Publisher · View at Google Scholar · View at Scopus - C.-T. Tseng and C.-J. Liao, “A discrete particle swarm optimization for lot-streaming flowshop scheduling problem,”
*European Journal of Operational Research*, vol. 191, no. 2, pp. 360–373, 2008. View at Publisher · View at Google Scholar · View at Scopus - S. Marimuthu, S. G. Ponnambalam, and N. Jawahar, “Evolutionary algorithms for scheduling m-machine flow shop with lot streaming,”
*Robotics and Computer-Integrated Manufacturing*, vol. 24, no. 1, pp. 125–139, 2008. View at Publisher · View at Google Scholar · View at Scopus - P. Brucker, Yu. N. Sotskov, and F. Werner, “Complexity of shop-scheduling problems with fixed number of jobs: a survey,”
*Mathematical Methods of Operations Research*, vol. 65, no. 3, pp. 461–481, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - S. M. Johnson, “Optimal two-and three-stage production schedules with setup times included,”
*Naval Research Logistics Quarterly*, vol. 1, no. 1, pp. 61–68, 1954. View at Google Scholar