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

Oncu Hazir Safia Kedad-Sidhoum 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01185283
Contributor : Lip6 Publications <>
Submitted on : Wednesday, August 19, 2015 - 5:28:02 PM
Last modification on : Friday, May 24, 2019 - 5:24:46 PM

Identifiers

Citation

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

Share

Metrics

Record views

100