## Abstract

All three major classes of due-date assignment models (CON, SLK and DIF) have been solved in the literature for a minsum setting, and only two of them (CON and SLK) have been solved for a minmax setting. In this note we introduce a solution for the missing minmax model of DIF. Specifically, we study a single-machine scheduling and due-date assignment problem, in which job-dependent lead-times are considered. Three cost components for each job are assumed: earliness cost, tardiness cost, and the cost for delaying the due-date (beyond its lead-time). The goal is to schedule the jobs and to assign due-dates, such that the maximum cost among all the jobs is minimized. We introduce an O(n^{log2}n) solution algorithm (where n is the number of jobs).

Original language | English |
---|---|

Pages (from-to) | 2161-2164 |

Number of pages | 4 |

Journal | Computers and Operations Research |

Volume | 40 |

Issue number | 8 |

DOIs | |

State | Published - 1 Aug 2013 |

## Keywords

- Scheduling Single machine Due-date assignment Minmax Lead-time

## ASJC Scopus subject areas

- Computer Science (all)
- Modeling and Simulation
- Management Science and Operations Research