透過您的圖書館登入
IP:13.59.212.54
  • 期刊

Mixed Binary Integer Programming Formulation for the Two-Echelon Supply Chain System with Two Customer Locations

並列摘要


Coordinating works between production and delivery is a crucial issue for the management of production and logistics. This study developed a single machine scheduling model that incorporated delivery vehicle routing decisions and serves two customer locations. The objective was to minimize the mean arrival time. The problem is NP-hard in the strong sense in general. A mixed binary integer programming (BIP) model was developed to optimally solve this problem. In addition, computational results of the illustrative example are reported using the mixed BIP model to solve the proposed problem.

參考文獻


Chang, Y. C.,Lee, C. Y.(2004).Machine scheduling with job delivery coordination.European Journal of Operational Research.158,470-487.
Chen, Z. L.(1996).Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs.European Journal of Operational Research.93,49-60.
Cheng, T. C. E.,Gordon, V. S.,Kovalyov, M. Y.(1996).Single machine scheduling with batch deliveries.European Journal of Operational Research.94,277-283.
Equi, L.,Gallo, G.,Marziale, S.,Weintraub, A.(1997).A combined transportation and scheduling problem.European Journal of Operational Research.97,94-104.
Garcia, J. M.,Lozano, S.,Canca, D.(2004).Coordinated scheduling of production and delivery from multiple plants.Robotics and Computer-Integrated Manufacturing.20,191-198.

被引用紀錄


邱錦盟(2014)。基於SNMP簡單網路管理協定控制單晶片系統〔碩士論文,國立臺中科技大學〕。華藝線上圖書館。https://doi.org/10.6826/NUTC.2014.00049

延伸閱讀