Paper Title:
A Computer-Aided System for Job-Shop Flow Time and Due–Date Prediction
  Abstract

: One of the key challenges confronting a production system is the accurate prediction of flow time (completion time) and due date of jobs coming into the job-shop. The inaccuracy in the determination of flow time and due date could lead to problems of dead line misses, high holding cost for waiting jobs and/or completed jobs, technical and cost inefficiency; and customer dissatisfaction, among others. In this paper, a Computer-Aided System which is based on an empirical model for predicting job-shop flow time and due-date was developed. The Computer-Aided System makes use of historical production data and other peculiar in-house factors of an organization. The Computer-Aided System was tested with real life job-shop data in order to test its efficiency and it was found to be efficient in predicting flow time and due date of jobs.

  Info
Periodical
Chapter
Chapter 9: Systems Design and Analysis
Edited by
A.O. Akii Ibhadode
Pages
639-645
DOI
10.4028/www.scientific.net/AMR.367.639
Citation
B.O. Akinnuli, S.A. Oluwadare, A. A. Aderoba, "A Computer-Aided System for Job-Shop Flow Time and Due–Date Prediction", Advanced Materials Research, Vol. 367, pp. 639-645, 2012
Online since
October 2011
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Ying Yu, Chen Wei Wang, Ji Zhu
Chapter 3: System Analysis and Industrial Engineering
Abstract:As uncertain processing time of some jobs may bring unpredicted deterioration of job shop scheduling performance, a measure of VaR is...
386
Authors: Wan Nazdah Wan Hussin, Adnan Hassan, A.H. Halim, Z. Zakaria
II. Industrial Engineering
Abstract:This paper presents a preliminary work on a development of dynamic job shop scheduling model. The motivation of the study comes from an...
682
Authors: S. Gobinath, C. Arumugam, G. Ramya, M. Chandrasekaran
Chapter 2: Intelligent Algorithms and Industry Development, its Applications for Manufacturing Engineering and Automation
Abstract:The classical job-shop scheduling problem is one of the most difficult combinatorial optimization problems. Scheduling is defined as the art...
176