Scheduling for non regular performance measure under the due window approach

Sabuncuoğlu, İhsan; Lejmi, Tahar

doi:10.1016/s0305-0483(99)00018-3

Cited by 11 publications

(4 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Single processor scheduling problems with due window were simulated using the desktop tool module (editor) on MATLAB R2010 programming language. The number of jobs (n), the processing times (pi), and the due windows (di) time interval were generated using the Süer et al, [18] and [19]. The processing time P follows the uniform distribution U(1, 10).…”

Section: Experimentationmentioning

confidence: 99%

Minimizing Conditional Mean Tardiness and Mean Earliness on a Single Machine with the due Windows Approach

Akande,

Ajisegiri,

Azeez

2024

View full text Add to dashboard Cite

A Multicriteria scheduling problem that involves four due date-based performance measures; the total tardiness, proportion of tardy jobs, total earliness as well as the proportion of early jobs was reduced to an equivalent bicriteria problem of minimizing conditional mean Tardiness and conditional mean earliness. A schedule that optimizes these measures tend towards an ideal Just-In-Time (JIT) schedule. Two solution methods named GOA 1 and GOA 2 were proposed to solve the equivalent reduced problem. A single machine and due window approach was explored. The ideal JIT schedule with zero tardiness and zero earliness was set as the optimal and used for benchmarking the proposed solution as well as other methods found in the literature. The results show that the proposed heuristics yielded results that are not significantly different from the optimal in some instances.

show abstract

Section: Experimentationmentioning

confidence: 99%

Minimizing Conditional Mean Tardiness and Mean Earliness on a Single Machine with the due Windows Approach

Akande,

Ajisegiri,

Azeez

2024

View full text Add to dashboard Cite

show abstract

“…Dispatching rules have been used in the last few decades to address scheduling problems for their simplicity and ease of use (Drake et al, 1995;Mohanasunduram et al, 2003;Sabuncuoglu & Lejmi, 1999). Dispatching rules can be classified into different categories based on different factors.…”

Section: Production Schedulingmentioning

confidence: 99%

Scheduling of a computer integrated manufacturing system: A simulation study

Bhuiyan

Gouw²,

Yazdi³

2011

JIEM

View full text Add to dashboard Cite

Purpose: The purpose of this paper is to study the effect of selected scheduling dispatching rules on the performance of an actual CIM system using different performance measures and to compare the results with the literature.

Design/methodology/approach: To achieve this objective, a computer simulation model of the existing CIM system is developed to test the performance of different scheduling rules with respect to mean flow time, machine efficiency and total run time as performance measures.

Findings: Results suggest that the system performs much better considering the machine efficiency when the initial number of parts released is maximum and the buffer size is minimum. Furthermore, considering the average flow time, the system performs much better when the selected dispatching rule is either Earliest Due Date (EDD) or Shortest Process Time (SPT) with buffer size of five and the initial number of parts released of eight.

Research limitations/implications: In this research, some limitations are: a limited number of factors and levels were considered for the experiment set-up; however the flexibility of the model allows experimenting with additional factors and levels. In the simulation experiments of this research, three scheduling dispatching rules (First In/First Out (FIFO), EDD, SPT) were used. In future research, the effect of other dispatching rules on the system performance can be compared. Some assumptions can be relaxed in future work.

Practical implications: This research helps to identify the potential effect of a selected number of dispatching rules and two other factors, the number of buffers and initial number of parts released, on the performance of the existing CIM systems with different part types where the machines are the major resource constraints.

Originality/value: This research is among the few to study the effect of the dispatching rules on the performance of the CIM systems with use of terminating simulation analysis. This is also significant given the nature of the CIM systems that are mostly used to produce different parts in varying quantities and thus do not produce parts on a continuing basis. This research is amongst the first to study the combined effect of dispatching rule and the buffer size in the CIM systems where the job arrivals are predetermined and depend on the completion of the existing parts in the system. A description of how buffer size and initial part release is related to the performance of the CIM system under study for the studied priority dispatching rule is also provided.

show abstract

“…Therefore, minimizing sources of leakages and income losses like overproduction, high inventory cost, waiting and down tool time is a prerequisite. Just-In-Time (JIT) production has proved to be an essential requirement of world-class manufacturing concept [1]. This has made researchers to explore different variants of Earliness-Tardiness (E/T) scheduling problems to support the realization of JIT environment characterized by zero earliness, zero tardiness and zero inventories.…”

Section: Introductionmentioning

confidence: 99%

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

Akande¹,

Ajisegiri²,

Adegoke³

et al. 2022

JESA

View full text Add to dashboard Cite

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.

show abstract

Scheduling for non regular performance measure under the due window approach

Cited by 11 publications

References 14 publications

Minimizing Conditional Mean Tardiness and Mean Earliness on a Single Machine with the due Windows Approach

Minimizing Conditional Mean Tardiness and Mean Earliness on a Single Machine with the due Windows Approach

Scheduling of a computer integrated manufacturing system: A simulation study

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

Contact Info

Product

Resources

About