Scheduling for on-time completion in job shops using feasibility function

Authors:
Attila Lengyel;Itsuo Hatono;Kanji Ueda
Affiliations:
MI-2 Laboratory, Faculty of Engineering, Kobe University 1-1, Rokkodai, Nada, Kobe 657-8501, Japan;Information Processing Center, Kobe University 1-1, Rokkodai, Nada, Kobe 657-8501, Japan;RACE (Research into Artifacts, Center for Engineering), The University of Tokyo, Komaba, 4-6-1, Meguro-ku, Tokyo 153-8904, Japan
Venue:
Computers and Industrial Engineering
Year:
2003

Citing 4
Cited 3

Sequencing with earliness and tardiness penalties: a review

Operations Research
Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date

Computers and Operations Research
Job shop scheduling for missed due-date performance

Computers and Industrial Engineering
Single-machine scheduling with a common due window

Computers and Operations Research

Agent based dynamic job shop simulation system

IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
A real-time job-shop scheduling method based on adaptive agent

ROCOM'06 Proceedings of the 6th WSEAS international conference on Robotics, control and manufacturing technology
A study of factors affecting due date predictibility for on-time delivery in a dynamic job shop

AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article focuses on job shop type manufacturing systems where a high variety of product of different volumes are requested to be produce on a tight due date. The feasibility function (FF) is addressed in this article to schedule jobs in multi-machine random job shop, where the purpose is to minimize unit penalty by achieving a balance between the number of tardy and early jobs, and reducing the difference between the maximum and the minimum lateness of jobs. A job shop simulation model based on multi-agent architecture developed by the authors provides an environment for comparing the FF to commonly used dispatching rules. The results show the benefit of using the FF. Discussions reveal that this concept is more reliable in case of due dates with different tightness level.