Scheduling Incompatible Job Families on A Single Machine: A Two-Level Heuristic Approach

Mohamed K., Omar and Yasothei, Suppiah and S. C., Teo and J. A., Bennell (2008) Scheduling Incompatible Job Families on A Single Machine: A Two-Level Heuristic Approach. In: International Conference on Industrial Engineering and Engineering Management , 08-11 DEC 2008 , Singapore, SINGAPORE.

Full text not available from this repository.
Official URL: http://apps.webofknowledge.com/full_record.do?prod...

Abstract

We introduce a two-level heuristic approach for solving jobs originated from incompatible job families that aims to minimize the total weighted tardiness. At the first level, an apparent tardiness cost with setups (ATCS) for a single machine is developed. The second level, a Tabu Search (TS) heuristic is developed that uses the initial solution obtained by the ATCS and provides a better solution if it exist. Real industrial data is used to test and validate the proposed methodology. The results indicate that the suggested approach can provide solution in a reasonable good time that can be of use for the decision maker.

Item Type: Conference or Workshop Item (Paper)
Subjects: T Technology > T Technology (General)
Q Science > QA Mathematics > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Engineering and Technology (FET)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 21 Sep 2011 07:53
Last Modified: 21 Sep 2011 07:53
URI: http://shdl.mmu.edu.my/id/eprint/2832

Actions (login required)

View Item View Item