Dispatching Rules for Minimizing Deviation from JIT Schedule Using the Earliness - Tardiness Scheduling Problem with Due Windows Approach

Saheed Akande, Ganiyu O. Ajisegiri, Abdullah A. Adegoke, Omolayo M. Ikumapayi*, Esther T. Akinlabi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

In Earliness-Tardiness (E/T) scheduling approach, the Just-In-Time (JIT) schedule is a schedule with zero earliness and zero tardiness. However, this is an optimal schedule and even notional in some instances where tardiness and earliness are inevitable. However, minimizing the deviation at the upper region (tardiness) and the lower region (earliness) from the JIT schedule is a challenge. This work proposes solutions. Two proposed heuristics; TA1 and TA2 as well as some existing heuristics were explored to solve simulated problems ranging from 5≤n≤400 and the results obtained were benchmarked against the JIT schedule. The results obtained show that one of the heuristics, TA2 yielded JIT schedules for many problem sizes at the lower and upper deviation than other solution methods.

Original languageEnglish
Pages (from-to)377-385
Number of pages9
JournalJournal Europeen des Systemes Automatises
Volume55
Issue number3
DOIs
Publication statusPublished - 30 Jun 2022
Externally publishedYes

Cite this