Research Article | Open Access
Huawei Yuan, Yuanwei Jing, Jinping Huang, Tao Ren, "Optimal Research and Numerical Simulation for Scheduling No-Wait Flow Shop in Steel Production", Journal of Applied Mathematics, vol. 2013, Article ID 498282, 5 pages, 2013. https://doi.org/10.1155/2013/498282
Optimal Research and Numerical Simulation for Scheduling No-Wait Flow Shop in Steel Production
This paper considers the m-machine flow shop scheduling problem with the no-wait constraint to minimize total completion time which is the typical model in steel production. First, the asymptotic optimality of the Shortest Processing Time (SPT) first rule is proven for this problem. To further evaluate the performance of the algorithm, a new lower bound with performance guarantee is designed. At the end of the paper, numerical simulations show the effectiveness of the proposed algorithm and lower bound.
Steel-making is a multistage process in which melted iron is converted into steel products sequentially by the processes of converting furnace, heating furnace, and rolling mill. Distinctly, this is a very typical model of the flow shop. Differently, in the steel production, the hot work-in-processes can not wait between two successive operations. For example, a slab has to reach a rolling temperature through the heat furnace before it can be processed by the rolling mill. If a heated slab waits for a long time in front of the machine, its temperature will drop significantly. Once the temperature of a slab falls below the rolling temperature, the reheating must be executed, which will consume a lot of energy. Furthermore, the size of the work-in-process in steel-making is especially large, which limits the storage capacity of the buffer between two successive machines. As minimizing the criterion of total completion time (TCT; the detail about TCT objective can be found in [1, 2]) can effectively reduce the in-process inventory, the research of no-wait flow shop with TCT objective is reasonably effective for iron and steel industry.
With the standard scheduling notation suggested by Graham et al. in 1979 , the no-wait flow shop scheduling problem to minimize TCT can be denoted by . Röck  indicated the strong NP-hardness for problem which means that the optimal solution for the general problem,, cannot be obtained in polynomial time unless P = NP. Allahverdi and Aldowaisan  considered the problem, where denotes that the setup time is sequence dependent. Optimal solutions were obtained for two special flow shops and a dominance relation is developed for the general problem. Several heuristic algorithms with polynomial computational time are constructed. Allahverdi and Aldowaisan  addressed problem , where denotes that the setup times are separate from processing times and sequence independent. Optimal solutions and a dominance relation were presented, respectively, for certain cases and the general case. Five heuristic algorithms were developed and evaluated for small and large number of jobs. Aldowaisan and Allahverdi  provided new heuristics and compared the performance of these proposed algorithms with that of three existing heuristics for problem . Gao et al.  present two constructive heuristics, improved standard deviation heuristic (ISDH), and improved Bertolissi heuristic (IBH) for problem , and propose four composite heuristics, using the insertion-based local search method and iteration operator to improve the solutions of the ISDH and IBH. Allahverdi and Aydilek  discussed problem , , where is a certain value. An algorithm is proposed to find an upper bound on the makespan in case the upper bound is not given or unknown. Given the upper bound on makespan, a proposed algorithm and a genetic algorithm are utilized for solving the problem. A survey of problem can be found in .
In this paper, the asymptotic optimality of the Shortest Processing Time (SPT) first SPT rule is proved for problem in the sense of probability limit, where the research is restricted to the permutation schedule (the details about permutation schedule can be found in [1, 2]). To further evaluate the strategy, a new lower bound with performance guarantee is designed. At the end of the paper, numerical simulations show the convergence of the algorithm and the effectiveness of the lower bound.
The remainder of the paper is organized as follows. The problem is formulated in Section 2, the asymptotic optimality of the SPT rule is proved in Section 3. The new lower bound and computational experiments are presented in Sections 4 and 5, respectively. And in Section 6, this paper is closed by the conclusions.
2. Problem Specification
In no-wait flow shop problem, a set of n jobs has to be sequentially processed on m different machines without preemption. Each job , , passes through the m machines in identical order and requires processing time on machine , . It is assumed that the processing times are independently and identically distributed (i.i.d.) random variables, defined on the interval . At any given time each machine can handle at most one job and each job can be processed on at most one machine. Jobs are available simultaneously, and the permutation schedule is considered; that is, all jobs are processed on all machines in the same order. The jobs cannot wait between two successive machines and the intermediate storage is zero. A job that was finished on a given machine must remain on it until the next machine completes the processing of the preceding job. Let denote the time that job , , actually takes to depart machine , . The time job j starts its processing at the first machine is denoted by . The completion time of job is denoted by . The objective is to find a sequence of jobs under the constraint of permutation schedule to minimize the sum of completion times on the final machine; that is, .
3. Proof of Asymptotic Optimality for SPT Rule
The SPT rule is actually a heuristic in which the jobs are scheduled in nondecreasing order according to value . With the tool of asymptotic analysis, the asymptotic optimality of the SPT rule for problem is introduced as follows.
Theorem 1. Let the processing times , , , be independent random variables having the same continuous distribution with bounded density defined on . Then, with probability one where is the objective value obtained by the SPT rule, and is the optimal value.
Proof. The jobs to be scheduled are index in the SPT sequence. For arbitrary job number , , the processing times that appear in a SPT sequence can be expressed as followsWe add the processing times of job 1 at the left bottom and that of job at the right top, respectively, and obtain a matrix as follows:For a given SPT sequence, with matrix , we have Summing all over the jobs and dividing m on both sides of (4), we have where and are the lower bound values of LB and LB, respectively. Denote the completion time of job j in LB, LB, and the SPT sequence by , , and , respectively. For the jobs, the gap between the SPT sequence and the lower bound is where denotes the set that includes the jobs on machine , , in the critical path. Dividing on both sides of (6) and taking limit, we have where denotes the expectation of the processing times, and the penultimate inequality of (7) is because of the Law of Large Numbers. Let be the maximum value of among the jobs. Therefore, we have Summing all over the jobs, we have Dividing on both sides of (8) and taking limit, we have With limits (8) and (9), we obtain the result of the theorem.
4. The New Lower Bound
As the stronger NP-hardness of the problem, the lower bound is usually a substitution of the optimal solution. In 2013, Bai and Ren  presented an asymptotically optimal lower bound, LB1, for problem as follows: where
This lower bound can deal with problem without any change. But in some cases, LB1 does not work well. For instance, consider the following example (see Figure 1).
Example 1. There is three-machine flow shop problem with three jobs. The processing times of these jobs are ; ; and . Therefore, the optimal sequence is and the optimal value is 38 (see Figure 1). For the associated LB1 value, we have And the gap between the optimal value and LB1 is (38 − 27)/27 × 100% ≈ 40.74%. Obviously, the error is considerable. To improve the performance of LB1, a new lower bound, LB, is provided. Consider where is the lower bound value of LB. Calculate Example 1 with LB, and obtain the value 38.
Theorem 2. For any instance of problem , we have where is the objective value of LB1.
Proof. Consider a given optimal schedule for in which the jobs are indexed from 1 to n. Denoting the completion time of job , , in LB as , we have Therefore, we have Summing all over the jobs, we can obtain the result of the theorem.
5. Computational Results
In this section, we designed a series of computational experiments to reveal the convergence of the SPT rule and the effectiveness of the new lower bound in different size problems. Firstly, we compare the SPT rule with LB to show convergence trend. And then, we compare LB with LB to show the effectiveness of LB. Different combinations of jobs and machines are tests to show the performance variation when parameters vary. Combinations with five, ten, and 15 machines with 100, 200, 500, 1000, and 1500 jobs are tested for testing the SPT rule and lower bound LB. The processing times were randomly generated from a discrete uniform distribution on , and a normal distribution with mean and variance 49, respectively. Ten different random tests for each combination of the parameters were performed, and the averages are reported.
The ratios SPT/LB showed in Table 1 are the objective values of the SPT rule to those of LB. From the data in the table, we can see that the ratios of SPT/LB approach one as the number of jobs increases from 100 to 1500 with the fixed number of machines. For example, in 15 machines with uniform distribution, the ratio of SPT/LB drops from 1.04071 to 1.01291 when the number of jobs increases from 100 to 1500. This phenomenon indicates the asymptotic optimality of the SPT rule. Contrarily, for the fixed number of jobs, ratios of SPT/LB enlarge as the number of machines increases from 5 to 15. The cause may be that the larger the number of machines, the larger the quantity of idle times inserted, which enlarges the gap between the value of objective and its lower bound.
The ratios LB/LB showed in Table 2 are the values of LB to LB. The data in the table reveal that LB is obviously superior to LB for moderate scale problems. As the number of jobs keeps enlarging, LB approaches LB more and that conforms the asymptotic optimality of LB.
In this paper, we investigate a very useful scheduling problem in steel production, the no-wait flow shop minimizing total completion time. The asymptotic optimality of the classical SPT rule is proven with the tool of asymptotic analysis when the problem scale is large enough. For the promotion of numerical simulation, a new lower bound with performance guarantee is given. Computational results show that the SPT rule and the new lower bound work well for large scale problems.
This research is partly supported by the National Natural Science Foundation of China (61104074), Fundamental Research Funds for the Central Universities (N110417005), China Postdoctoral Science Foundation (2013T60294, 20100471462), Scientific Research Foundation for Doctor of Liaoning Province of China (20101032), and the 2011 Plan Project of Shenyang City (F11-264-1-63).
- Y. N. Sotskov, T. Tautenhahn, and F. Werner, “Heuristics for permutation flow shop scheduling with batch setup times,” OR Spectrum, vol. 18, no. 2, pp. 67–80, 1996.
- Y. N. Sotskov, A. Allahverdi, and T.-C. Lai, “Flowshop scheduling problem to minimize total completion time with random and bounded processing times,” Journal of the Operational Research Society, vol. 55, no. 3, pp. 277–286, 2004.
- R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. R. Kan, “Optimization and approximation in deterministic sequencing and scheduling: a survey,” Annals of Discrete Mathematics, vol. 5, pp. 287–326, 1979.
- H. Röck, “Some new results in flow shop scheduling,” Zeitschrift für Operations Research A, vol. 28, no. 1, pp. 1–16, 1984.
- A. Allahverdi and T. Aldowaisan, “Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times,” Journal of the Operational Research Society, vol. 52, no. 4, pp. 449–462, 2001.
- A. Allahverdi and T. Aldowaisan, “No-wait and separate setup three-machine flowshop with total completion time criterion,” International Transactions in Operational Research, vol. 7, pp. 245–264, 2000.
- T. Aldowaisan and A. Allahverdi, “New heuristics for m-machine no-wait flowshop to minimize total completion time,” Omega, vol. 32, no. 5, pp. 345–352, 2004.
- K. Gao, Q. Pan, P. N. Suganthan, and J. Li, “Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization,” The International Journal of Advanced Manufacturing Technology, 66, pp. 1563–1572, 2013.
- A. Allahverdi and H. Aydilek, “Algorithms for no-wait flowshops with total completion time subject to makespan,” The International Journal of Advanced Manufacturing Technology, vol. 68, no. 9, pp. 2237–2251, 2013.
- N. G. Hall and C. Sriskandarajah, “A survey of machine scheduling problems with blocking and no-wait in process,” Operations Research, vol. 44, no. 3, pp. 510–525, 1996.
- D. Bai and T. Ren, “New approximation algorithms for flow shop total completion time problem,” Engineering Optimization, vol. 45, no. 9, pp. 1091–1105, 2013.
Copyright © 2013 Huawei Yuan et al. 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.