Integrating parts design characteristics and scheduling on parallel machines

被引:10
作者
Cevikcan, Emre [1 ]
Durmusoglu, M. Bulent [1 ]
Baskak, Murat [1 ]
机构
[1] Istanbul Tech Univ, Dept Ind Engn, Fac Management, TR-34367 Istanbul, Turkey
关键词
Scheduling; Sequence-dependent setup times; Parts design; Parallel machines; DEPENDENT SETUP TIMES; RESOURCE CONSTRAINTS; ROLLING-HORIZON; TABU SEARCH; UP TIMES; SEQUENCE; JOBS; ALGORITHM; EARLINESS;
D O I
10.1016/j.eswa.2011.04.140
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Setup times have an important effect on providing quick response to the external besides internal customers. As well as eliminating setup activities, jobs with sequence-dependent setup times should be scheduled efficiently so as to reduce setup times. In this paper, a scheduling methodology which considers parts design characteristics is presented for parallel machines. With respect to the roadmap of the methodology, a parts design characteristics based scheduling algorithm is developed in order to reduce total setup times. When evaluating the performance of sequencing methods, the cable cutting-stripping-crimping (CSC) process of a real life wiring harness production system is focused. In the current scheduling system of CSC division, cable sequences are developed semi-manually by CSC supervisors. Making the proposed methodology compatible with cable sequencing, an expert system is developed so as to reduce the burden of supervisors and improve effectiveness. Performance comparison of scheduling algorithms is based on deviation from the lower bound for the total setup time as well as previously implemented semi-manual cable sequences. With respect to performance comparison, parts design characteristics based scheduling algorithm has resulted in 6.81% reduction of the total setup time compared to implemented semi-manual cable sequences (MCS) for 45-day production data. (C) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码:13232 / 13253
页数:22
相关论文
共 47 条
  • [1] A review of scheduling research involving setup considerations
    Allahverdi, A
    Gupta, JND
    Aldowaisan, T
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1999, 27 (02): : 219 - 239
  • [2] Group technology in a hybrid flowshop environment:: A case study
    Andrés, C
    Albarracín, JM
    Tormo, G
    Vicens, E
    García-Sabater, JP
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 167 (01) : 272 - 281
  • [3] Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
    Anghinolfi, Davide
    Paolucci, Massimo
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (11) : 3471 - 3490
  • [4] Robust scheduling of parallel. machines with sequence-dependent set-up costs
    Anglani, A
    Grieco, A
    Guerriero, E
    Musmanno, R
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 161 (03) : 704 - 720
  • [5] ARMANTANO VAA, 2007, EUR J OPER RES, V183, P100
  • [6] SCHEDULING AND ORDER RELEASE IN A SINGLE-STAGE PRODUCTION SYSTEM
    ASHBY, JR
    UZSOY, R
    [J]. JOURNAL OF MANUFACTURING SYSTEMS, 1995, 14 (04) : 290 - 306
  • [7] Early/tardy scheduling with sequence dependent setups on uniform parallel machines
    Balakrishnan, N
    Kanet, JJ
    Sridharan, V
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (02) : 127 - 141
  • [8] Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm
    Behnamian, J.
    Zandieh, M.
    Ghomi, S. M. T. Fatemi
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (06) : 9637 - 9644
  • [9] Scenario-based planning for lot-sizing and scheduling with uncertain processing times
    Beraldi, P
    Ghiani, G
    Guerriero, E
    Grieco, A
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2006, 101 (01) : 140 - 149
  • [10] Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs
    Beraldi, Patrizia
    Ghiani, Gianpaolo
    Grieco, Antonio
    Guerriero, Emanuela
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (11) : 3644 - 3656