Batch Sizing and Just-In-Time Scheduling with Common Due Date - Archive ouverte HAL Access content directly
Journal Articles Annals of Operations Research Year : 2014

Batch Sizing and Just-In-Time Scheduling with Common Due Date

Oncu Hazir
  • Function : Author
Safia Kedad-Sidhoum

Abstract

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.
No file

Dates and versions

hal-01185283 , version 1 (19-08-2015)

Identifiers

Cite

Oncu Hazir, Safia Kedad-Sidhoum. Batch Sizing and Just-In-Time Scheduling with Common Due Date. Annals of Operations Research, 2014, 213 (1), pp.187-202. ⟨10.1007/s10479-012-1289-9⟩. ⟨hal-01185283⟩
54 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More