Supply Chain Scheduling with Fixed Time-Interval Supplies
We consider an inbound logistics scheduling model where the supplies that are necessary for the processing of a given set of jobs are delivered at regular (fixed-interval) points in time. These points in time serve as potential release (ready) dates for n jobs that have to be processed on a single machine. The objective of the problem is to select for each job a release date and schedule all n jobs on the machine without preemptions such that the total flow time of all jobs is minimized subject to the constraint that there is no idle time in the schedule. We show that the problem is NP-hard in the ordinary sense, and propose a dynamic programming algorithm for solving it. We also develop heuristic algorithms to solve the problem with worst case performance analyses.
supply chain scheduling single machine flow time release date flxed time-interval
Joseph Y-T . Leung Michael L. Pinedo Guohua Wan
Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, U.S.A. tern School of Business, New York University, 44 West 4th Street, New York, NY 10012, U.S.A. Faculty of Business Administration, University of Macau, Macau, China
国际会议
2007 International Conference on Manufacturing & Service Operations Management(2007制造与服务运作管理国际学术会议)
北京
英文
2007-06-18（万方平台首次上网日期，不代表论文的发表时间）