Loading...
Please wait, while we are loading the content...
Similar Documents
Lagrangian relaxation algorithms for hybrid flow-shop with earliness/tardiness scheduling problems
| Content Provider | Semantic Scholar |
|---|---|
| Author | Ding, Xiaoli Liu, Chang Li, Dong |
| Copyright Year | 2014 |
| Abstract | This paper considers the characteristics of a hybrid flow shop with JIT technical constraints. Lagrangian relaxation is presented to solve the Earliness/Tardiness problem in the hybrid flow-shop. By introducing precedence constraints into the objective function, the original problem is decomposed into a series of parallel machine sub-problems and a dynamic programming algorithm is designed to solve these sub-problems. Heuristic approach is further applied to convert the infeasible solution into a feasible solution. Testing results demonstrated that the proposed method can generate near optimal schedules in an acceptable computational time. |
| Starting Page | 1257 |
| Ending Page | 1260 |
| Page Count | 4 |
| File Format | PDF HTM / HTML |
| DOI | 10.1109/WCICA.2014.7052900 |
| Alternate Webpage(s) | http://ir.sia.ac.cn/bitstream/173321/16951/1/Lagrangian%20relaxation%20algorithms%20for%20hybrid%20flow-shop%20with%20earliness_tardiness%20scheduling%20problems.pdf |
| Alternate Webpage(s) | https://doi.org/10.1109/WCICA.2014.7052900 |
| Journal | Proceeding of the 11th World Congress on Intelligent Control and Automation |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
