Algorithm for Solving Job Shop Scheduling Problem Based on machine availability constraint
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 5
Abstract
Typically, general job shop scheduling problems assume that working times of machines are equal, for instance eight hours a day. However, in real factories, these working times are different because the machines may have different processing speeds, or they may require maintenance. That is, one machine may need to be operated only half day whereas other machines may have to be operated for the entire day. So, each machine has its own working time window. In this paper, this type of problem is referred to as a job shop scheduling problem based on machine availability constraint which is more omplex than typical job shop scheduling problems. In the previous research, this type of problem has been rarely investigated before. Thus a new lgorithm is developed based on a on-delay scheduling heuristic by adding machine availability constraint to solve job shop scheduling problem with minimize makespan objective. The newly developed algorithm with the machine availability constraint assumption is more realistic. The study reveals the result of algorithm that consider machine availability constraint is better than the result of algorithm that ignores machine availability constraint when apply to the real problem.
Authors and Affiliations
Kanate Ploydanai , Anan Mungwattana
Keywords
Related Articles
- EP ID EP139731
- DOI -
- Views 106
- Downloads 0
Backpropagation Learning Algorithms for Email Classification.
Today email has become one the fastest and most effective form of communication. The popularity of this mode of transmitting goods, information and services has motivated spammers to perfect their technical skills to foo...
PERFORMANCE CONTRIBUTION BASED SCHEDULING FRAMEWORK FOR PRECEDENCE CONSTRAINT TASKS IN REAL TIME SYSTEM
It is quite possible that in a process set, process may be having earliest deadline but its performance contribution is low in process set. Scheduling such processes with highest priority does not carry any meaning. Majo...
Comparison a Performance of Data Mining Algorithms (CPDMA) in Prediction Of Diabetes Disease
Detection of knowledge patterns in clinicial data through data mining. Data mining algorithms can be trained from past examples in clinical data and model the frequent times non-linear relationships between the independe...
Job-Oriented Monitoring of Clusters
There has been a lot of development in the field of clusters and grids. Recently, the use of clusters has been on rise in every possible field. This paper proposes a system that monitors jobs on large computational clust...
A Survey on Sensor’s Drift Counteraction Using Dynamic Pattern Recognition System
In past years, numerous electronic nose (e-nose) evelopments have been published describing analyses of solid-, liquid- or gaseous media in microbiological-environmental-, gricultural- or medical applications. However, l...