TIME MINIMIZING TRANSSHIPMENT PROBLEM

被引：0
|
作者：
GARG, R
PRAKASH, S
机构：
来源：
INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS | 1985年 / 16卷 / 05期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：449 / 460
页数：12
相关论文
共 50 条
  • [1] An algorithm for solving time minimizing capacitated transshipment problem
    Khurana, Archana
    Verma, Tripti
    Arora, S. R.
    [J]. INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE AND ENGINEERING MANAGEMENT, 2012, 7 (03) : 192 - 199
  • [2] Solving time minimising transshipment problem
    Khurana, Archana
    Verma, Tripti
    Arora, S. R.
    [J]. INTERNATIONAL JOURNAL OF SHIPPING AND TRANSPORT LOGISTICS, 2015, 7 (02) : 137 - 155
  • [3] The pickup and delivery problem with time windows and transshipment
    Mitrovic-Minic, Snezana
    Laporte, Gilbert
    [J]. INFOR, 2006, 44 (03) : 217 - 227
  • [4] The pickup and delivery problem with time windows and transshipment
    Department of Mathematics, Simon Fraser University, 13450-102 Avenue, Surrey, BC V3T 5X3, Canada
    不详
    [J]. INFOR, 2006, 3 (217-227)
  • [5] Transshipment problem with uncertain customer demands and transfer lead time
    Hmiden, Mohamed
    Ben Said, Lamjed
    Ghedira, Khaled
    [J]. CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 476 - 481
  • [6] Variants of transshipment problem
    Archana Khurana
    [J]. European Transport Research Review, 2015, 7
  • [7] The Transshipment Problem through Fixed Transportation Schedules with Time Windows
    Miao, Zhaowei
    Yang, Feng
    Cao, Mukun
    [J]. ICPOM2008: PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE OF PRODUCTION AND OPERATION MANAGEMENT, VOLUMES 1-3, 2008, : 351 - 356
  • [8] The dynamic transshipment problem
    Herer, YT
    Tzur, M
    [J]. NAVAL RESEARCH LOGISTICS, 2001, 48 (05) : 386 - 408
  • [9] Variants of transshipment problem
    Khurana, Archana
    [J]. EUROPEAN TRANSPORT RESEARCH REVIEW, 2015, 7 (02)
  • [10] The quickest transshipment problem
    Hoppe, B
    Tardos, E
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 2000, 25 (01) : 36 - 62
12345