Batch sizing and just-in-time scheduling with common due date

被引:0
作者
Öncü Hazır
Safia Kedad-Sidhoum
机构
[1] TED Üniversitesi,LIP6
[2] Université Pierre et Marie Curie,undefined
来源
Annals of Operations Research | 2014年 / 213卷
关键词
Batch sizing; Scheduling; Single machine; Earliness; Tardiness; Common due-date;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, we address the optimal batch sizing and just-in-time scheduling problem where upper and lower bounds on the size of the batches are imposed. The objective is to find a feasible schedule that minimizes the sum of the weighted earliness and tardiness penalties as well as the setup costs, which involves the cost of creating a new batch. We present some structural properties of the optimal schedules and describe solving algorithms for the single machine problem.
引用
收藏
页码:187 / 202
页数:15
相关论文
共 42 条
  • [1] Azizoglu M.(1997)Scheduling job families about an unrestricted common due date on a single machine International Journal of Production Research 35 1321-1330
  • [2] Webster S.(2005)A comprehensive review of lot-streaming International Journal of Production Research 43 1515-1536
  • [3] Chang J. H.(1996)Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs European Journal of Operational Research 93 49-60
  • [4] Chiu H. N.(2001)Single machine batch scheduling with sequential processing IIE Transactions 33 413-420
  • [5] Chen Z. L.(2011)Integrated lot-streaming an scheduling on a single machine Journal of Scheduling 14 541-555
  • [6] Cheng T. C. E.(1990)Batch sizing and job sequencing on a single machine Annals of Operations Research 26 135-147
  • [7] Kovalyov M. Y.(2003)Supply chain scheduling: batching and delivery Operations Research 51 566-584
  • [8] Chrétienne P.(2005)The coordination of scheduling and batch deliveries Annals of Operations Research 135 41-64
  • [9] Hazir O.(2009)The one-machine just-in-time scheduling problem with preemptions Discrete Optimization 6 10-22
  • [10] Kedad-Sidhoum S.(1993)On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date European Journal of Operational Research 70 272-288