A NOTE: MINMAX DUE-WINDOW ASSIGNMENT WITH FIXED EARLINESS-TARDINESS COSTS

G. U.R. MOSHEIOV, ASSAF SARIG

Research output: Contribution to journalArticlepeer-review

Abstract

A single machine scheduling and due-window assignment problem is studied. The objective function is of a minmax type, i.e., the goal is to minimize the maximum cost among all processed jobs. In the classical setting of due-window assignment problems, there are four cost components: for job-earliness, job-tardiness, due-window starting-time and due-window size. We consider in this note a general cost structure which contains in addition to the standard linear earliness and tardiness cost components, a fixed penalty. Thus, early and tardy jobs are penalized also by a fixed cost which is independent of their actual earliness and tardiness values. We show that there are six candi-dates for the optimal starting time and size of the due-window. Consequently, an efficient, polynomial-time solution algorithm is introduced.

Original languageEnglish
Pages (from-to)3552-3561
Number of pages10
JournalJournal of Industrial and Management Optimization
Volume20
Issue number11
DOIs
StatePublished - Nov 2024

Keywords

  • Due-window assignment
  • Fixed-plus-linear cost
  • polynomial time solution
  • Scheduling
  • Single-machine

All Science Journal Classification (ASJC) codes

  • Business and International Management
  • Strategy and Management
  • Control and Optimization
  • Applied Mathematics

Cite this