Single Machine Scheduling Model with Total Tardiness Problem

Tyagi, Neelam; Tripathi, R. P.; Chandramouli, A. B.

doi:10.17485/ijst/2016/v9i37/97527

Cited by 7 publications

(3 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The average of TFT taken over eleven thousand solved problems using different PDRs is shown in Figure 1. It is evident from Figure 1 that the least value of TFT (328.67 days) is obtained when job sequencing is done using SPT rule and this result is in line with the result reported in literature (Lu et al, 2012;Tyagi et al, 2016). Further, mean based PDRs i.e.…”

Section: Simulation Studysupporting

confidence: 89%

“…To the best of authors knowledge, these rules have not been proposed yet in literature. Further, researchers have used single machine scheduling problem (SMSP) and simulation based study to compare the effectiveness of the newly developed PDRs over standard rules (Cheng and Kahlbacher, 1993;Tyagi et al, 2016). Therefore, a simulation study is also conducted in this work to evaluate the effectiveness of the proposed rules over FCFS, SPT, EDD, SLACK, CR and PDT on the basis of five performance measures viz.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Geometric and harmonic means based priority dispatching rules for single machine scheduling problems

Ahmad

Khan

Ali

et al. 2021

Int. J. Prod. Manag. Eng.

View full text Add to dashboard Cite

<span lang="ES">This work proposes two new prority dispatching rules (PDRs) for solving single machine scheduling problems. These rules are based on the geometric mean (GM) and harmonic mean (HM) of the processing time (PT) and the due date (DD) and they are referred to as GMPD and HMPD respectively. Performance of the proposed PDRs is evaluated on the basis of five measures/criteria i.e. Total Flow Time (TFT), Total Lateness (TL), Number of Late Jobs (TNL), Total Earliness (TE) and Number of Early Parts (TNE). It is found that GMPD performs better than other PDRs in achieving optimal values of multiple performance measures. Further, effect of variation in the weight assigned to PT and DD on the combined performance of TFT and TL is also examined which reveals that for deriving optimal values of TFT and TL, weighted harmonic mean (WHMPD) rule with a weight of 0.105 outperforms other PDRs. The weighted geometric mean (WGMPD) rule with a weight of 0.37 is found to be the next after WHMPD followed by the weighted PDT i.e. WPDT rule with a weight of 0.76.</span>

show abstract

Section: Simulation Studysupporting

confidence: 89%

Section: Introductionmentioning

confidence: 99%

Geometric and harmonic means based priority dispatching rules for single machine scheduling problems

Ahmad

Khan

Ali

et al. 2021

Int. J. Prod. Manag. Eng.

View full text Add to dashboard Cite

show abstract

“…For the tardiness related parameters, a few of the approaches tested to minimize the performance measures were the Branch and Bound algorithm (Tyagi et al, 2016), Excel Workbook tool, sequentially searching through each of the 'n!' sequences possible.…”

Section: Tardiness Performance Measuresmentioning

confidence: 99%

Simulation of Job Sequencing for Stochastic Scheduling with a Genetic Algorithm

Bari¹,

Karande²,

Menezes³

2022

Oper. Res. Eng. Sci. Theor. Appl.

View full text Add to dashboard Cite

Sequencing is done to determine the order in which the jobs are to be processed. Extensive research has been carried out with an aim to tackle real-world scheduling problems. In industries, experimentation is performed before an ultimate choice is made to know the optimal priority sequencing rule. Therefore, an extensive approach to selecting the correct choice is necessary for the management decisionmaking perspective. In this research, the genetic algorithm (GA) and working of a simulation environment are explained, in which a scheduling operator, under any given circumstances, can obtain the appropriate sequence for job scheduling in a shop. The paper also explains the stochastic based linguistic, scenarios and probabilistic approaches to solve sequencing problem. The simulation environment allows the operator to select the tardiness and non-tardiness related performance measures. The simulator takes input values such as number of jobs, processing time and due date and discovers a near-optimal sequence for scheduling of jobs that minimizes the performance measures selected by the operator as per requirement. The case study considered is solved using scenarios based stochastic scheduling approach and results are shown. The results are compared with the classical method used in the company and observed that the proposed approach gives a better result.

show abstract