曲阜师范大学学报（自然科学版）Issue(3)：35-40,6.DOI:10.3969/j.issn.1001-5337.2014.3.035
工件可拒绝的分批配送问题研究
A Research on Batch Delivery With Job Rej ection
王素美1
作者信息
- 1. 曲阜师范大学管理学院，276826，山东省日照市
- 折叠
摘要
Abstract
Two scheduling problems with batch delivery and j ob rej ection are considened as follows.For the first one,there are n jobs to be processed on a single machine.Each job is either be rejected,while a re-jection penalty has to be paid,or be accepted and processed on the machine.After processed,the jobs should be delivered by vehicles to the customer.The completion time of a job is the time when it arrives at the cus-tomer area.The obj ective is to minimize the sum of the total completion time and delivery cost of the ac-cepted jobs,and the total rejection penalty of the rejected jobs.A dynamic programming algorithm for this problem is provided,which runs in polynomial time.For the second one,which differs from the first one that jobs are processed by two parallel machines.The second problem is NP-complete,and a pseudo-polyno-mial time algorithm is given.关键词
可拒绝/分批/配送/动态规划Key words
rej ection/batch/delivery/dynamic programming分类
数理科学引用本文复制引用
王素美..工件可拒绝的分批配送问题研究[J].曲阜师范大学学报（自然科学版）,2014,(3):35-40,6.
