Scheduling Incompatible Job Families on A Single Machine: A Two-Level Heuristic Approach
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) heurist...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://shdl.mmu.edu.my/2832/ |