Description: m Taiwan different machines, n different workpiece. Each have a process workpiece, and each procedure specified by the machine in a fixed time. A process once started, it can not be interrupted. Each machine can only handle one time processes. Scheduling is a decision each machine processes the order processing, machinery parts to complete all the shortest time. Specifically, the problem is meeting the requirements (1), (2) 2 restrictive conditions on the premise that each machine to determine the order of the manufacturing process, so that the processing time span (from the beginning of the processing of all jobs have been finished.Chen the time required) to a minimum. Among them, (1) workpiece restrictive conditions : for each workpiece, the machine's processing line it is determined
To Search:
- [Dijkstra-c++] - algorithm commonly used data structures
- [FIFO-shao] - process FIFO scheduling algorithm, prior
- [ga_cpp] - genetic algorithm FT, the source LA, and
- [ex4] - Parts mutilation given width W of a rect
- [ex] - Optimal scheduling problem, assuming tha
- [zonghe] - * comprehensive application of algorithm
- [lab_5] - There are m different machines, n differ
- [GA_term_project] - Flowshop scheduling survived by law, to
- [greed] - Greedy algorithm Collection, including t
File list (Check if you may need any files):
Download