Efficient Sub-Optimal Earliest Deadline with Local Search Job Shop Scheduling Algorithm
Minimizing the turnaround time for job orders on the manufacturing shop floor can raise the utilization and efficiencies of the resources in an organization. In some cases, it can reduce capital expenditure for more machines whilst handling the same amount of work load. The key is to schedule the individual processes in the job order to reduce slack time whilst adhering to the process ordering constraints of each job order. Using an algorithm to schedule processes with the earliest deadline is a simple and quick way to create a suboptimal job shop schedule. However this gives rise to gaps in the machine utilization, which can be exploited to further reduce the overall turnaround time. This paper presents an additional step through the local search mechanism which does not cost much more computationally to the overall algorithm.
component job shop scheduling fast earliest deadline local search
Chee-Keong Lee Ian K.T.Tan
Technical Services iEnterprise Online Sdn Bhd Petaling Jaya, Malaysia Faculty of Information Technology Multimedia University Cyberjaya, Malaysia
国际会议
成都
英文
484-488
2010-07-09（万方平台首次上网日期，不代表论文的发表时间）