An integrative heuristic method for detailed operations scheduling in assembly job shop systems

被引:20
|
作者
Pereira, Mario T. [1 ]
Santoro, Miguel C. [1 ]
机构
[1] Univ Sao Paulo, Polytech Sch, Dept Prod Engn, Sao Paulo, Brazil
关键词
assembly job shop; simulation; scheduling heuristics; sequencing rule; tardiness; PRIORITY DISPATCHING RULES; TARDINESS; JOBSHOPS; FLOWTIME;
D O I
10.1080/00207543.2010.527385
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper, we describe a new heuristic method for simulating and supporting the operations scheduling process in assembly job shop systems. The method is based on the assumption that the improvement in operations synchronisation at fabrication and assembly stations brings forth better achievement of due dates. The method implements two scheduling approaches: a backward approach satisfying due date completely and a forward approach satisfying capacity restrictions completely. The two approaches work iteratively within two different simulation models of the production system - one deterministic and the other probabilistic - in searching for operations synchronisation improvement and due date achievement. The method intends to be integrative, i.e., to be able to integrate effectively three fundamental enterprise systems: order processing, production scheduling, and manufacturing activity control. An experimental study was conceived to evaluate the suitability of the method to support scheduling decision making. As results demonstrate, the method proves to be suitable for this objective. As a co-product, results show the method is better than the single-pass procedure/rules tested on average and is as good as the best single-pass procedure/rule tested.
引用
收藏
页码:6089 / 6105
页数:17
相关论文
共 50 条
  • [1] Heuristic Method for Job Shop Scheduling Problem with Combination Processing
    YI Ping1
    2. College of Machinery and Automation
    [J]. CADDM, 2009, (01) : 56 - 63
  • [2] A new heuristic method for job-shop scheduling problem
    Kuang-Ping Liu
    [J]. 2006 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-6, PROCEEDINGS, 2006, : 3708 - 3714
  • [3] Heuristic method for dynamic job shop scheduling problem with operation relativity
    College of Mechanical Automation, Wuhan University of Science and Technology, Wuhan 430081, China
    不详
    [J]. Jixie Gongcheng Xuebao, 2006, 8 (50-55):
  • [4] A Heuristic Method for Job-Shop Scheduling with an Infinite Wait Buffer
    Zhao, Z. J.
    Kim, J.
    Luo, M.
    Lau, H. C.
    Ge, S. S.
    Zhang, J. B.
    [J]. 2008 IEEE CONFERENCE ON CYBERNETICS AND INTELLIGENT SYSTEMS, VOLS 1 AND 2, 2008, : 1046 - +
  • [5] A heuristic combination method for solving job-shop scheduling problems
    Hart, E
    Ross, P
    [J]. PARALLEL PROBLEM SOLVING FROM NATURE - PPSN V, 1998, 1498 : 845 - 854
  • [6] Heuristic method for job shop scheduling based on decomposed due date
    Institute of Automation, Shanghai Jiaotong University, Shanghai 200030, China
    [J]. Kongzhi yu Juece Control Decis, 2006, 3 (253-257):
  • [7] A parallel implementation of a job shop scheduling heuristic
    Der, U
    Steinhöfel, K
    [J]. APPLIED PARALLEL COMPUTING, PROCEEDINGS: NEW PARADIGMS FOR HPC IN INDUSTRY AND ACADEMIA, 2001, 1947 : 215 - 222
  • [8] A heuristic algorithm for the job shop scheduling problem
    Yin, AH
    [J]. NETWORK AND PARALLEL COMPUTING, PROCEEDINGS, 2004, 3222 : 118 - 128
  • [9] A new heuristic algorithm for job shop scheduling
    Pan, YC
    Feng, YC
    [J]. ICIM' 2004: PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON INDUSTRIAL MANAGEMENT, 2004, : 191 - 196
  • [10] Flexible job shop scheduling with overlapping in operations
    Fattahi, Parviz
    Jolai, Fariborz
    Arkat, Jamal
    [J]. APPLIED MATHEMATICAL MODELLING, 2009, 33 (07) : 3076 - 3087