Batch delivery scheduling with limited waiting time constraint on a single machine

  • Authors:

  • Hua Gong;Lixin Tang

  • Affiliations:

  • College of Science, Shenyang Ligong University, Shenyang, China and Liaoning Key Laboratory of Manufacturing System and Logistics, The Logistics Institute, Northeastern University, Shenyang, China;Liaoning Key Laboratory of Manufacturing System and Logistics, The Logistics Institute, Northeastern University, Shenyang, China

  • Venue:
  • CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we study a batch delivery scheduling problem on a single machine in which the waiting time of a finished Job on the machine is no more than a limited value. The waiting time of a job is defined as the difference between its completion time and the delivery date of the batch to which it belongs. The objective is to minimize the sum of the batch delivery cost and the makespan. We analyze some properties for the optimal schedule and prove the strong NP-hardness of the problem. When there is no long job, we propose a heuristic algorithm with worst-case 3. When there are some long jobs, we propose a heuristic with worst-case ratio 4.