A Scheduling Heuristic for Job Shop Manufacturing System

• Autores: Chih-Hung Tsai, Yi-Chan Chung, Chih-Ming Chen
• Localización: International journal of the computer, the internet and management, ISSN 0858-7027, Vol. 14, Nº. 2 (MAY-AGO), 2006, págs. 36-51
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • In the past, many production-scheduling methods were developed to achieve high due-date and short manufacturing lead times performance. Among them, DRUMBUFFER-ROPE (DBR) has been recognized as one of the excellent solutions. However, there are some implementation constraints (e.g., time buffer determination, setup ratio evaluation, non-CCR subordination etc.) limit its implementation performance. To overcome these limits and enhance the DBR implementation, we present a novel scheduling heuristic algorithm for job shop manufacturing system based on Capacity Constraint Resource (CCR). The proposed algorithm consists of four stages: (1) schedule development for CCR (DRUM), (2) CCR setup time savings to decrease mean tardiness, (3) CCR setup time savings to maximize CCR throughput, and (4) development of a hybrid scheduling method to minimize total flowtime and the work-inprocess (WIP) inventory. Also, an illustrative example demonstrates the feasibility of the proposed method.