期刊文献+

Anomalies in Special Permutation Flow Shop Scheduling Problems 被引量:1

下载PDF
导出
摘要 Recent researches show that there are some anomalies,which are not satisfied with common sense,appearing in some special permutation flow shop scheduling problems(PFSPs).These anomalies can be divided into three different types,such as changing the processing time of some operations,changing the number of total jobs and changing the number of total machines.This paper summarizes these three types of anomalies showing in the special PFSPs and gives some examples to make them better understood.The extended critical path is proposed and the reason why these anomalies happen in special PFSPs is given:anomalies will occur in these special PFSPs when the time of the operations on the reverse critical path changes.After that,the further reason for these anomalies is presented that when any one of these three types of anomalies happens,the original constraint in the special PFSPs is destroyed,which makes the anomalies appear.Finally,the application of these anomalies in production practice is given through examples and also with the possible research directions.The main contribution of this research is analyzing the intial reason why the anomalies appear in special PFSPs and pointing out the application and the possible research directions of all these three types of anomalies.
出处 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2020年第3期53-59,共7页 中国机械工程学报(英文版)
基金 Supported by National Natural Science Foundation of China(Grant No.51825502).
  • 相关文献

参考文献3

二级参考文献46

  • 1ZHAO Ning,CHEN Siyu,DU Yanhua.Emergency Local Searching Approach for Job Shop Scheduling[J].Chinese Journal of Mechanical Engineering,2013,26(5):918-927. 被引量:4
  • 2Aldowaisan T, Allahverdi A. New heuristic for no-wait flowshops to minimize makespan. Computer & Operation Research, 2003, 30(5): 1219-1231.
  • 3Schuster C J, Framinan J M. Approximative procedure for no-wait job shop scheduling. Operations Research Letters, 2003, 31(4): 308-18.
  • 4Grabowski J, Pempera J. Some local search algorithms for no-wait flow-shop problem with makespan criterion. Computers & Operations Research, 2005, 32(8): 2197-2122.
  • 5Liu B, Wang L, Jin Y H. An effective hybrid particle swarm optimization for no-wait flow shop scheduling. International Journal of Advanced Manufacturing Technology, 2007, 31 (9-10) : 1001-1011.
  • 6Pan Q K, Tasgetiren M F, Liang Y C. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan criterion//Proceedings of the International Workshop on UK Planning and Scheduling Special Interest Group. London: City University, 2005: 31- 41.
  • 7Pan Q K, Tasgetiren M F, Liang Y C. Minimizing total earliness and tardiness penalties with a common due date on a single-machine using a discrete particle swarm optimization algorithm//Aat Colong Optimization and Swarm Intelligence. Lecture Notes in Computer Science 4150, 2006: 460- 467.
  • 8Pan Q K, Wang L. No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algo rithm. International Journal of Advanced Manufacturing Technology, 2007, doi: 10. 1007/s00170-007-1252-0.
  • 9Spieksma F C R, Woeginger G J. The no-wait flow-shop paradox. Operations Research Letters, 2005, 33(6) : 603-608.
  • 10Kalczynski P J, Kamburowski J. On no-wait and no-idle flow shops with makespan criterion. European Journal of Operational Research, 2007, 138(3) : 677-685.

共引文献40

同被引文献5

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部