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

Hazir O., Kedad-Sidhoum S.

ANNALS OF OPERATIONS RESEARCH, vol.213, no.1, pp.187-202, 2014 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 213 Issue: 1
  • Publication Date: 2014
  • Doi Number: 10.1007/s10479-012-1289-9
  • Journal Name: ANNALS OF OPERATIONS RESEARCH
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.187-202
  • Keywords: Batch sizing, Scheduling, Single machine, Earliness, Tardiness, Common due-date, SUPPLY CHAIN, MACHINE, EARLINESS, JOBS
  • TED University Affiliated: Yes

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.