Browse > Article

A Note on the Reversibility of the Two Stage Assembly Scheduling Problem  

Yoon, Sang-Hum (College of Business, Yeungnam University)
Lee, Ik-Sun (Department of Industrial Engineering, Korea Advanced Institute of Science and Technology)
Sung, Chang-Sup (Department of Industrial Engineering, Korea Advanced Institute of Science and Technology)
Publication Information
Management Science and Financial Engineering / v.13, no.1, 2007 , pp. 25-34 More about this Journal
Abstract
This paper is concerned with proving a conjecture that the two stage assembly system is reversible in deterministic makespan scheduling context. The reversibility means that a job sequence in the assembly system has the same makespan as that of its reverse sequence in the disassembly system which is the reversal of the assembly system. The proposed conjecture shows that the reversibility of serial flowshops can be extended to non-serial and synchronized shops.
Keywords
Scheduling; Reversibility; Assembly System; Disassembly System;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Potts, C. N., S. V. Sevast'janov, V. A. Strusevich, L. N. van Wassenhove, and C. M. Zwaneveld, 'The two-stage assembly scheduling problem: complexity and approximation,' Operations Research 43 (1995), 346-355   DOI   ScienceOn
2 Yoon, S. H. and C. S. Sung, 'Fixed pre-assembly scheduling on multiple fabrication machines,' International Journal of Production Economics 96 (2005), 109-118   DOI   ScienceOn
3 Duda, A. and T. Czachorski, 'Performance evaluation of fork and join synchronization primitives,' Acta Informatica 24 (1987), 525-553
4 Lee, C.-Y., T. C. E. Cheng, and B. M. T. Lin, 'Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem,' Management Science 39 (1993), 616-625   DOI   ScienceOn
5 Muth, E. J., 'The reversibility property of production lines,' Management Science 25 (1979), 152-158   DOI   ScienceOn
6 Hodgson, T. J. and G. W. McDonald, 'Interactive scheduling of a generalized flow shop. Part 1: success through evolutionary development,' Interfaces 11 (1981), 42-47
7 Hariri, A. M. A. and C. N. Potts, 'A branch and bound algorithm for the two-stage assembly scheduling problem,' European Journal of Operational Research 103 (1997), 547-556   DOI   ScienceOn
8 Gershwin, S. B., Manufacturing Systems Engineering, Prentice-Hall, 1994
9 Sun, X., K. Morizawa, and H. Nagasawa, 'Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling,' European Journal of Operational Research 146 (2003), 499-517
10 O'Shea, B., S. S. Grewal, and H. Kaebernick, 'State of the art literature survey on disassembly planning,' Concurrent Engineering: Research and Applications 6 (1998), 345-357   DOI   ScienceOn
11 Gungor, A. and S. M. Gupta, 'Disassembly sequence planning for products with defective parts in product recovery,' Computers and Industrial Engineering 35 (1998), 161-164   DOI   ScienceOn