Periodic Due Date Assignment with Family Setups

Authors

  • Sevilay Sertdemir Bogazici University
  • Ali Tamer Unal Bogazici University
  • Zehra Duzgit Bogazici University

DOI:

https://doi.org/10.23055/ijietap.2019.26.6.4832

Keywords:

scheduling, due date assignment, lead time quotation, family setup, mixed integer programming

Abstract

In this study we consider a single machine due date assignment problem involving dynamic job arrivals and family setups. The due date quotation process that we investigate is based on periodically generating schedules of new and existing jobs, and quoting due dates using a function of completion times of jobs in the schedule. We propose a mixed integer linear programming formulation to solve the underlying scheduling problem. We also present a function to quote due dates for new jobs. We
report the performance of the proposed due date quotation process based on the simulation study that is carried out under various shop and solution procedure parameters.

Author Biographies

Sevilay Sertdemir, Bogazici University

Department of Industrial Engineering

Ali Tamer Unal, Bogazici University

Department of Industrial Engineering

Zehra Duzgit, Bogazici University

Department of Industrial Engineering

Published

2020-01-05

How to Cite

Sertdemir, S., Unal, A. T., & Duzgit, Z. (2020). Periodic Due Date Assignment with Family Setups. International Journal of Industrial Engineering: Theory, Applications and Practice, 26(6). https://doi.org/10.23055/ijietap.2019.26.6.4832

Issue

Section

Modelling and Simulation