Browse > Article

A Scheduling Problem to Minimize Weighted Completion Time in the Two-stage Assembly-type Flowshop  

Yoon, Sang Hum (School of Management, Yeungnam University)
Lee, Ik Sun (Department of Industrial Engineering, KAIST)
Lee, Jong Hyup (Department of Information and Communications Engineering, Inje University)
Publication Information
Journal of Korean Institute of Industrial Engineers / v.33, no.2, 2007 , pp. 254-264 More about this Journal
Abstract
This paper considers a scheduling problem to minimize the total weighted completion time in the two-stage assembly-type flowshop. The system is composed of multiple fabrication machines in the first stage and a final-assembly machine in the second stage. Each job consists of multiple components, each component is machined on the fabrication machine specified in advance. The manufactured components of each job are subsequently assembled into a final product on the final-assembly machine. The objective of this paper is to find the optimal schedule minimizing the total weighted completion time of jobs. Three lower bounds are derived and tested in a branch-and-bound (B&B) Procedure. Also, three heuristic algorithms are developed based on the greedy strategies. Computational results show that the proposed B&B procedure is more efficient than the previous work which has considered the same problem as this paper.
Keywords
Scheduling; Assembly System; Branch-and-Bound;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Baker, K. R. (1974), Introduction to Sequencing and Scheduling, John Wiley & Sons
2 Bhat, U. N. (1986), Finite Capacity Assembly-like Queues, Queueing Systems, 1, 85-101.   DOI
3 Norahari, Y. and Sundarrajan, P. (1995), Performability Analysis of Fork-Join Queueing Systems, Journal of the Operational Research Society, 46, 1237-1249   DOI   ScienceOn
4 Potts, C. N., Sevast'janov, S. Y., Strusevich, V. A., Wassenhove, L. N., and Zwaneveld, C. M. (1995), The Two-Stage Assembly Scheduling Problem: Complexity and Approximation, Operations Research, 43, 346-355   DOI   ScienceOn
5 Leung, J. Y. T., Li, H., and Pinedo, M. (2006b), Scheduling Orders for Multiple Product Types with Due Date Related Objectives, European Journal of Operational Research, 168, 370-389   DOI   ScienceOn
6 Duda, A. and Czachorski, T. (1987), Performance Evaluation of Fork and Join Syschronization Primitives, Acta Informatica, 24, 525-553
7 Leung, J. Y. T., Li, H., and Pinedo, M. (2006a), Approximation Algorithms for Minimizing Total Weighted Completion Time of Orders on Identical Machines in Parallel, Naval Research Logistics, 53, 243-260   DOI   ScienceOn
8 He, D. W. and Kusiak, A. (1996), Performance Analysis of Modular Products, International Journal of Production Research, 34, 253-272   DOI   ScienceOn
9 Yang, J. and Posner, M. E. (2005), Scheduling Parallel Machines for the Customer Order Problem, Journal of Scheduling, 8, 49-74   DOI   ScienceOn
10 Yoon, S. H. and Sung, C. S. (2005), Fixed Pre-assembly Scheduling on Multiple Fabrication Machines, International Journal of Production Economics, 96, 109-118   DOI   ScienceOn
11 Sun, X., Morizawa, K., and Nagasawa, H. (2003), Powerful Heuristics to Minimize Makespan in Fixed, 3-Machine, Assembly-type Flowshop Scheduling, European Journal of Operational Research, 146, 499-517
12 Tozkapan, A., Kirca, O., and Chung, C. S. (2003), A Branch-andBound Algorithm to Minimize the Total Weighted Flowtime for the Two-stage Assembly Scheduling Problem, Computers & Operations Research, 30, 309-320   DOI   ScienceOn
13 Hariri, A. M. A. and Potts, C. N. (1997), A Branch-and-Bound Algorithm for the Two-Stage Assembly Scheduling Problem, European Journal of Operational Research, 103, 547-556   DOI   ScienceOn
14 Leung, J. Y. T., Li, H., and Pinedo, M. (2005a), Order Scheduling in an Environment with Dedicated Resources in Parallel, Journal of Scheduling, 8, 355-386   DOI   ScienceOn
15 Sung, C. S. and Yoon, S. H. (1998), Minimizing Total Weighted Completion Time at a Pre-assembly Stage Composed of Two Feeding Machines, International Journal of Production Economics, 54, 247-255   DOI   ScienceOn
16 Baker, K. R., Powell, S. G., and Pyke, D. F. (1993), Optimal Allocation of Work in Assembly Systems, Management Science, 39, 101-106   DOI   ScienceOn
17 Leung, J. Y. T., Li, H., and Pinedo, M. (2005b), Order Scheduling Models: an Overview, Multidisciplinary Scheduling, 1, 37-56
18 Lee, C. Y., Cheng, T. C. E., and Lin, B. M. T. (1993), Minimizing the Makespan in the 3-Machine Assembly-type Flowshop Scheduling Problem, Management Science, 39, 616-625   DOI   ScienceOn
19 Ahmadi, R., Bagchi, D., and Roemer, T. A. (2005), Coordinated Scheduling of Customer Orders for Quick Response, Naval Research Logistics, 52, 493-512   DOI   ScienceOn
20 Baker, K. R. and Powell, S. G. (1993), A Predictive Model for the Throughput of Simple Assembly Systems, European Journal of Operational Research, 81, 336-345
21 Wang, G. and Cheng, T. C. E. (2007), Customer Order Scheduling to Minimize Total Weighted Completion Time, to appear in Omega