:::

詳目顯示

回上一頁
題名:A Heuristic Solution to the Total Tardiness and Earliness Penalties of an M-Machine Nonpreemptive Open-Shop Schedule
書刊名:工業工程學刊
作者:吳雪馥
作者(外文):Lin, Hsueh-foo
出版日期:1998
卷期:15:2
頁次:頁159-167
主題關鍵詞:數學規劃網路模式開放式排程Mathematical programmingNetwork modelOpen-shopScheduling
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:22
期刊論文
1.Lawler, E. L.、Lenstra, J. K.、Rinnooy Kan, A. H. G.(1981)。Minimizing maximum lateness in a two-machine open shop。Mathematics of Operations Research,6(1),153-158。  new window
2.Graham, R. L.、Lawler, E. L.、Lenstra, J. K.、Rinnooy Kan, A. H. G.(1979)。Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey。Annals of Discrete Mathematics,5,287-326。  new window
3.Achuthan, N.、Grabowski, J.、Sidney, J.(1981)。Optimal flow-shop scheduling with earliness and tardiness penalties。Opsearch,18,117-138。  new window
4.Emmons, H.(1969)。One-machine sequencing to minimize certain function of job tardiness。Operations Research,17,701-715。  new window
5.Ow, P. S.、Morton, T. E.(1989)。The single machine early/ tardy problem。Management Science,35,117-191。  new window
6.Sidney, J. B.(1977)。Optimal single-machine scheduling with earliness and tardiness penalties。Operations Research,25,62-69。  new window
7.Srinivasan, V.(1971)。A hybrid algorithm for the one machine sequencing problem to total tardiness。Naval Research Logistic Quarterly,18,317-327。  new window
圖書
1.Conway, R. W.、Maxwell, W. L.、Miller, L. W.(1976)。Theory of scheduling。MA:Addison Wesley。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE