Browse > Article

Production Scheduling for a Two-machine Flow Shop with a Batch Processing Machine  

Koh, Shie-Gheun (Department of Systems Management and Engineering, Pukyong National University)
Koo, Pyung-Hoi (Department of Systems Management and Engineering, Pukyong National University)
Kim, Byung-Nam (Department of Systems Management and Engineering, Pukyong National University)
Publication Information
Journal of Korean Institute of Industrial Engineers / v.34, no.4, 2008 , pp. 481-488 More about this Journal
Abstract
This paper deals with a scheduling problem for two-machine flow shop, in which the preceding machine is a batch processing machine that can process a number of jobs simultaneously. To minimize makespan of the system, we present a mixed integer linear programming formulation for the problem, and using this formulation, it is shown that an optimal solution for small problem can be obtained by a commercial optimization software. However, since the problem is NP-hard and the size of a real problem is very large, we propose a number of heuristic algorithms including genetic algorithm to solve practical big-sized problems in a reasonable computational time. To verify performances of the algorithms, we compare them with lower bound for the problem. From the results of these computational experiments, some of the heuristic algorithms show very good performances for the problem.
Keywords
Scheduling; Batch Process; Flow Shop; Integer Programming; Heuristic;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Ikura, Y. and Gimple, M. (1986), Scheduling algorithms for a single batch processing machine, Operations Research Letters, 5, 61-65   DOI   ScienceOn
2 Koh, S. G., Koo, P. H., Kim, D. C. and Hur, W. S. (2005), Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families, International Journal of Production Economics, 98, 81-96   DOI   ScienceOn
3 Johnson, S. M. (1954), Optimal two and three stage production schedules with setup times included, Naval Research Logistics Quartly, 1, 61-68   DOI
4 Uzsoy, R. (1995), Scheduling batch processing machines with incompatible job families, International Journal of Production Research, 33, 2685-2708   DOI   ScienceOn
5 Hochbaum, D. S. and Landy, D. (1997), Scheduling semiconductor burn-in operations to minimize total flowtime, Operations Research, 45, 874-885   DOI   ScienceOn
6 Chandra, P. and Gupta, S. (1997), Managing batch processors to reduce lead time in a semiconductor packaging line, International Journal of Production Research, 35, 611-633   DOI
7 Dobson, G. and Nambimadom, R. S. (2001), The batch loading and scheduling problem, Operations Research, 49, 52-65   DOI   ScienceOn
8 Kempf, K. G., Uzsoy, R., and Wang, C. S. (1998), Scheduling a single batch processing machine with secondary resource constraints, Journal of Manufacturing Systems, 17, 37-51   DOI
9 Koh, S. G., Koo, P. H., Ha, J. W., and Lee, W. S. (2004), Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families, International Journal of Production Research, 42, 4091-4107   DOI   ScienceOn
10 Bhatnagar, R., Chandra, P., Loulou, R., and Qiu, J. (1999), Order release and product mix coordination in a complex PCB manufacturing line with batch processors, The International Journal of Flexible Manufacturing Systems, 11, 327-351   DOI   ScienceOn
11 Uzsoy, R. (1994), Scheduling a single batch processing machine with non-identical job sizes, International Journal of Production Research, 32, 1615-1635   DOI   ScienceOn
12 Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., and Graham, R. L. (1974), Worst-case performance bounds for simple one-dimensional packing algorithms, SIAM Journal on Computing, 3, 299-325   DOI
13 Lee, C. Y. and Uzsoy, R. (1999), Minimizing makespan on a single batch processing machine with dynamic job arrivals, International Journal of Production Research, 37, 219-236   DOI   ScienceOn
14 Lee, C. Y., Uzsoy, R., and Martin-Vega, L. A. (1992), Efficient algorithms for scheduling semiconductor burn-in operations, Operations Research, 40, 764-775   DOI   ScienceOn
15 Chandru, V., Lee, C. Y., and Uzsoy, R. (1993), Minimizing total completion time on batch processing machines, International Journal of Production Research, 31, 2097-2121   DOI   ScienceOn
16 Ahmadi, J. H., Ahmadi, R. H., Dasu, S., and Tang, C. S. (1992), Batching and scheduling jobs on batch and discrete processors, Operations Research, 40, 750-763   DOI   ScienceOn
17 Mehta, S. V. and Uzsoy, R. (1998), Minimizing total tardiness on a batch processing machine with incompatible job families, IIE Transactions, 30, 165-178
18 Garey, M. R. and Johnson, D. S. (1979), Computers and Intractability : A Guide to the Theory of NPCompleteness (San Francisco : W. H. Freeman)