Flow-shop scheduling with setup and assembly operations

被引:35
|
作者
Yokoyama, Masao [1 ]
机构
[1] Fukushima Univ, Dept Ind Syst, Fac Symbiot Syst Sci, Fukushima 9601296, Japan
关键词
flow-shop scheduling; machining operation; assembly operation; setup time; block size; branch-and-bound; pseudo-dynamic programming;
D O I
10.1016/j.ejor.2006.06.067
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
A scheduling model for a production system including machining, setup and assembly operations is considered. Production of a number of single-item products is ordered. Each product is made by assembling a set of several different parts. First, the parts are manufactured in a flow-shop consisting of multiple machines. Then, they are assembled into products on a single assembly stage. Setup operation and setup time are needed when a machine starts processing the parts or it changes items. The operations are partitioned into several blocks. Each block consists of the machining operations, the setup operations.. and the assembly operation(s) for one or several products. The parts of the same item in a block are processed successively. The objective function is the mean completion time for all products. We consider a problem to partition the operations into blocks and sequence the parts in each block so as to minimize the objective function. Solution procedures using pseudo-dynamic programming and a branch-and-bound method are proposed. Computational experiments are carried out to evaluate the performance of the solution procedures. It has been found that a good near-optimal schedule is obtained efficiently by the proposed solution procedures. (C) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码:1184 / 1195
页数:12
相关论文
共 50 条
  • [21] ANTITHETIC SEQUENCES IN FLOW-SHOP SCHEDULING
    AZIM, MA
    MORAS, RG
    SMITH, ML
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1989, 17 : 353 - 358
  • [22] A genetic programming hyper-heuristic for the distributed assembly permutation flow-shop scheduling problem with sequence dependent setup times
    Song, Hong-Bo
    Lin, Jian
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2021, 60
  • [23] Surgical Scheduling based on Hybrid Flow-shop Scheduling
    Huang, Guoxun
    Xiang, Wei
    Li, Chong
    Zheng, Qian
    Zhou, Shan
    Shen, Bingqian
    Chen, Saifeng
    [J]. ADVANCES IN ENGINEERING DESIGN AND OPTIMIZATION III, PTS 1 AND 2, 2012, 201-202 : 1004 - +
  • [24] Modeling a flow-shop with setup times in dioid algebra
    Correia, Aurelien
    Abbas-Turki, Abdeljalil
    Bouyekhf, Rachid
    El Moudni, Abdellah
    [J]. PROCEEDINGS OF THE 2007 IEEE INTERNATIONAL CONFERENCE ON SERVICE OPERATIONS AND LOGISTICS, AND INFORMATICS, 2007, : 1 - +
  • [25] Using genetic algorithm in two-machine flexible flow-shop scheduling with setup times
    Huang, Shien-Ping
    [J]. JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2010, 31 (01): : 87 - 103
  • [26] Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling
    Chen, JS
    Pan, JCH
    [J]. INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2005, 36 (12) : 757 - 766
  • [27] A Heuristic Search Algorithm for Flow-Shop Scheduling
    Fan, Joshua Poh-Onn
    Winley, Graham K.
    [J]. INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 2008, 32 (04): : 453 - 464
  • [28] 4 SIMPLE HEURISTICS FOR SCHEDULING A FLOW-SHOP
    GELDERS, LF
    SAMBANDAM, N
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1978, 16 (03) : 221 - 231
  • [29] ON PINEDO CONJECTURE FOR SCHEDULING IN A STOCHASTIC FLOW-SHOP
    SURESH, S
    FOLEY, RD
    DICKEY, SE
    [J]. OPERATIONS RESEARCH, 1985, 33 (05) : 1146 - 1153
  • [30] DISCRETE HARMONY SEARCH FOR FLOW-SHOP SCHEDULING
    Wu, Jian
    Zhou, Hong
    [J]. ICIM2012: PROCEEDINGS OF THE ELEVENTH INTERNATIONAL CONFERENCE ON INDUSTRIAL MANAGEMENT, 2012, : 125 - 128