A framework is described which consists of the concepts of machines and jobs. In this framework, two methods for solving scheduling problems are proposed. The first method, called the heuristic placement method, selects a job using a heuristic algorithm, and then determines the position on time sequence, of machine processing. The second method, called the shakedown and compaction method, is an interactive improvement method. This method formulates initial job sequences by relaxing several constraints. Simple iterative operations are then used to improve job sequences for satisfying all constraints. Experimental results are presented on both of these methods. In addition, a system which consists of a job-modifier and a job-allocator is described.
展开▼
