Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Qufu Normal University(Natural Science)》 2010-04
Add to Favorite Get Latest Update

The Supply Chain Scheduling Problem with Transportation and Batching

ZHU Hong-li,WANG Xundi,ZHANG Yu-zhong(College of Operations Research and Management,Qufu Normal University,276826,Rizhao,Shandong,PRC)  
This paper investigates a supply chain scheduling problem,which integrates transportation and production.In the transportation stage,all the jobs are transported from the holding area to the batching machine by several vehicles.In the production stage,the batching machine processes some jobs as a batch which occurs a fixed processing cost.The objective is to minimize the makespan and total processing cost.We prove that it is NP-hard,and we provide a polynomial time algorithm for a special case of the problem.
【Fund】: 国家自然科学基金(10671108);; 教育部博士点基金项目(20070446001)
【CateGory Index】: O223
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
Chinese Journal Full-text Database 10 Hits
1 ZHANG Shu-juan,YANG Ming-ming,HAN Xiang-ling(College of Operations Research and Management Science,Qufu Normal University,Rizhao 276826,China);The Algorithm Reach of Supply Chain Scheduling Problems with Learning Effect[J];Journal of Binzhou University;2010-06
2 WANG Shen-zhong,WANG Guo-qiang,DU Hai-long (Sias College of Zhengzhou University,Zhengzhou 451150,China);A On-line Scheduling Problem on a Batch Maching with Limited Restares[J];Journal of Dezhou University;2010-06
3 LI Hai-xia1,ZHU Lu-ning2,ZHAO Sheng-ke2(1.Department of Basic Science,Shandong Water Polytechnic,Rizhao 276826,China; 2.Operation Research and Management,Qufu Normal University,Rizhao,276826,China);Batch Scheduling Algorithms for Similar Machines with Readiness Time[J];College Mathematics;2011-04
4 TANG Qingchen(Department of Mathematics,Jining University,Qufu Shandong 273155,China);Approximation algorithms for minimizing the delivery time when jobs have agreeable times[J];Journal of Jining University;2008-06
5 TANG Qingchen1,ZHAO Xin2(1.Mathematics Department Jining University,Qufu,273155,China;2.Qufu Xingtan Middle school,Qufu,273155,China);On-line scheduling on a batch processing machine with unbounded batch size to minimize the delivery time[J];Journal of Jining University;2009-06
6 FENG Da-guang1,2,TANG Li-xin1(1.Liaoning Key Laboratory of Manufacturing System and Logistics,The Logistics Institute,Northeastern University,Shenyang 110004,China;2 Science of Institue,Shenyang Agricultual University,Shenyang 110161,China);Research on the Scheduling of Single Batching Machine with Non-identical Job Size[J];Control Engineering of China;2011-03
7 Cao Jianfa(Xianda College of Economics & Humanities,Shanghai International Studies University,Shanghai 200083,China);Online Scheduling on a Batching Machine with Restarts to Maximize the Number of Early Jobs[J];Value Engineering;2010-14
8 LIU Li-li(School of Science,Shanghai Second Polytechnic University,Shanghai 201209,P.R.China);PTAS for Scheduling Jobs with Release Rates on Parallel Batch Processing Machines[J];Science Technology and Engineering;2009-12
9 LIU Li-li(School of Science,Shanghai Second Polytechnic University,Shanghai 201209,P.R.China);Minimizing the Makespan with Job Release Dates on Parallel Batch Processing Machines[J];Science Technology and Engineering;2011-31
10 ZHANG Zhi-guang1,2,SUN Zhi-hui1,ZHANG Ling-ling 1(1.College of Operations Research and Management Science,Qufu Normal University,Rizhao 276826,China;2.Department of Mathematics,Dezhou University,Dezhou 230023,China);A Batching Scheduling Algorithm for Maximizing Total Weigted Number of Jobs Completed in Due Date Window[J];Journal of Luoyang University;2007-02
China Proceedings of conference Full-text Database 4 Hits
1 Shoupeng Liu;Yuzhong Zhang College of Operations Research and Management Science,Qufu Normal University, Rizhao, Shangdong, 276826;On-line Scheduling with Rejection on Uniform Machines[A];[C];2004
2 Qingguo Bai;yuzhong Zhang College of Operations Research and Management Science, Qufu Normal University,Rizhao, Shandong, 276826, China;On-line Scheduling On a Single Batch Processing Machine With Non-identical Job Sizes[A];[C];2004
3 JIAO Feng-liang~1 CAO Zhi-gang~2 ZHANG Yu-zhong~1 (1.College of Operations Research and Management Science,Qufu Normal University,Rizhao 276826,China;2.Institute of Systems Science,Academy of Systems Science and Mathematics,Chinese Academy of Sciences,Beijing 100080 China.);Two Single Machine Bi-criteria Batch Scheduling Problems[A];[C];2008
4 Wu Cuilian (College of Management,Qufu Normal Univirsity,Rizhao 276826,China);Schenuling Jobs with Non-identical Sizes on a Single Batching Machine[A];[C];2011
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved