搜索资源列表
NEH
- NEH algorithm - scheduling of tasks performed by a machine
MILP
- Mixed integer linear programming source code
NEHsequence4
- 利用经典NEH算法求解工件排序的一种有效算法
locFile(2)
- Hehe download aja.bagus banget neh
neh.cpp
- An example of heurestic NEH algorithm implemented for task scheduling in C-An example of heurestic NEH algorithm implemented for task scheduling in C++
NEH_ForTFT
- 排序问题的NEH算法，用于解决最小总完工时间的无等待流水调度问题，是最有名的启发式算法-NEH algorithm is the best algorithm for serching the minimum total flow time of no wait flow-shop porblem
dpso
- 离散微粒群优化算法解决流水线调度问题。包含多个有名算法：NEH，局部搜索算法等。-Discrete Particle Swarm Optimization algorithm to solve assembly line scheduling problem. Contains several well-known algorithms: NEH, local search algorithm.
neh
- flow shop neh scheduling by makespan minimization
neh
- Linux driver,Radio Control Interface (WUSB[8]) Notification and Event Handling.
neh
- UWB Radio Controller Notification Event Handle.
neh
- Implementacja algorytmu NEH z akceleracją w C++. NEH algorithm with acceleration, C++ implementation. The program has 3 functions: data reading, data writting and NEH algorithm solving problem function based on read data file. The program dis
NEHTALGORYTHMCPP
- NEH TAILLARD ALGORITHM.. RUNS FASTER THAN STANDARD NEH
neh
- WUSB Wire Adapter: Radio Control Interface (WUSB[8]) Notification and Event Handling.
Flow-Job-with-NEH-initilization
- This Code source resoudre Flow-shop Problem. we use the GA algorithm with NEH initialzation algorithm.
neh_cpp
- Simple implementation of NEH algorithm in C++ with 120 test data files.
kmp
- KMP算法存在区别，于是尝试把01->00，再尝试打开，没有提示输入密码成功解压得到KMP 用mp3stego工具对文件进行解密。-KMP suan fa nim ma chao ni lao mu zhe xie zi gou le ma ? hai bu gou ,hai yao rang wo cao ni bu dnai fa fina fe mali nid de neh kminp daaf fecc var Standard information such as
NEH
- method insertions in classic problems scheduling - flow problem
NEH_F002
- 改进的NEH 算法求解no-wait flowshop 问题，复杂度降低为n^2m-Improved NEH algorithm for no-wait flowshop problem, the complexity is reduced to n ^ 2m
NEH.m
- 1.NEH principle (1) the processing time of each workpiece on all machines is summed; the summed values are sorted from large to small; (2) first select the first workpiece (the longest processing time), with the second workpiece into the first wo
flowshop_localSolver
- Flow shop CDS, NEH, Gentic