Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems
This paper considers the m-machine flow shop problem with two objectives: makespan with release dates and total quadratic completion time, respectively. For Fm|rj|Cmax, we prove the asymptotic optimality for any dense scheduling when the problem scale is large enough. For Fm‖ΣCj2, improvement strate...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2012/395947 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832556194146811904 |
|---|---|
| author | Tao Ren Yuandong Diao Xiaochuan Luo |
| author_facet | Tao Ren Yuandong Diao Xiaochuan Luo |
| author_sort | Tao Ren |
| collection | DOAJ |
| description | This paper considers the m-machine flow shop problem with two objectives: makespan with release dates and total quadratic completion time, respectively. For Fm|rj|Cmax, we prove the asymptotic optimality for any dense scheduling when the problem scale is large enough. For Fm‖ΣCj2, improvement strategy with local search is presented to promote the performance of the classical SPT heuristic. At the end of the paper, simulations show the effectiveness of the improvement strategy. |
| format | Article |
| id | doaj-art-71d3f479aecc46839c4cb94ef6eb6f2b |
| institution | Kabale University |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2012-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-71d3f479aecc46839c4cb94ef6eb6f2b2025-02-03T05:46:08ZengWileyJournal of Applied Mathematics1110-757X1687-00422012-01-01201210.1155/2012/395947395947Optimal Results and Numerical Simulations for Flow Shop Scheduling ProblemsTao Ren0Yuandong Diao1Xiaochuan Luo2Software College, Northeastern University, Shenyang 110004, ChinaPersonnel Department, Shenyang University of Chemical Technology, Shenyang 110142, ChinaState Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang 110004, ChinaThis paper considers the m-machine flow shop problem with two objectives: makespan with release dates and total quadratic completion time, respectively. For Fm|rj|Cmax, we prove the asymptotic optimality for any dense scheduling when the problem scale is large enough. For Fm‖ΣCj2, improvement strategy with local search is presented to promote the performance of the classical SPT heuristic. At the end of the paper, simulations show the effectiveness of the improvement strategy.http://dx.doi.org/10.1155/2012/395947 |
| spellingShingle | Tao Ren Yuandong Diao Xiaochuan Luo Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems Journal of Applied Mathematics |
| title | Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems |
| title_full | Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems |
| title_fullStr | Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems |
| title_full_unstemmed | Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems |
| title_short | Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems |
| title_sort | optimal results and numerical simulations for flow shop scheduling problems |
| url | http://dx.doi.org/10.1155/2012/395947 |
| work_keys_str_mv | AT taoren optimalresultsandnumericalsimulationsforflowshopschedulingproblems AT yuandongdiao optimalresultsandnumericalsimulationsforflowshopschedulingproblems AT xiaochuanluo optimalresultsandnumericalsimulationsforflowshopschedulingproblems |