Dynamic job-shop scheduling with sequence-dependent setup times: simulation modeling and analysis

Vinod, V.V.; Sridharan, R.

doi:10.1007/s00170-006-0836-4

Cited by 59 publications

(48 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From the machine queue, the job assigned by lowest preference value is taken up for work. Sridharan [30]). This rule chooses the job that has the lowest value of the sum of setup time and processing time.…”

Section: Job Scheduling Decision Rulesmentioning

confidence: 99%

Simulation modeling and analysis of job release policies in scheduling an agile job shop with process sequence dependent setting time

Vinod¹,

Prabagaran²,

Joseph³

2017

IJET

View full text Add to dashboard Cite

This paper analyses the effects of job release policies, priority scheduling rules and setup times on the performance of a dynamic job shop in a sequence dependent setup time environment. Two job release policies namely, immediate job release and job release based on a specified work-in-process are investigated. A simulation model of a realistic manufacturing system is developed for detailed analysis. The dynamic total work content method is adopted to assign the due dates of jobs. Six priority rules are applied for prioritizing jobs for processing on machines. Several performance criteria are considered for analyzing the system performance. The simulation results are used to conduct statistical tests. Analytical models have been formulated to represent the simulation model for post-simulation studies. These models are found to yield a satisfactory estimation of the system outputs.

show abstract

Section: Job Scheduling Decision Rulesmentioning

confidence: 99%

Simulation modeling and analysis of job release policies in scheduling an agile job shop with process sequence dependent setting time

Vinod¹,

Prabagaran²,

Joseph³

2017

IJET

View full text Add to dashboard Cite

show abstract

“…In turn, the mean flow time was minimized with job of the smallest critical ratio (JCR) rule (Kim and Bobrowski 1994), SIMSET (Kim and Bobrowski 1994) or the shortest setup + processing time (SSPT) rule (Vinod and Sridharan 2008). Similarly, the best effect on mean tardiness was registered in the case of JCR (Kim and Bobrowski 1994) and SSPT (Vinod and Sridharan 2008) rule. The JCR and SSPT are both combined rules.…”

Section: Scheduling Methodsmentioning

confidence: 99%

“…Combined rules also proved to outperform simple rules in researches that had not considered sequence-dependent setups (Dominic et al 2004). The popular shortest processing time (SPT) rule is also worth consideration because, despite its simplicity, it has produced some good results in some research (Dominic et al 2004;Holthaus and Rajendrant 1997;Vinod Sridharan 2008).…”

Section: Scheduling Methodsmentioning

confidence: 99%

“…-additive strategy, in which the priority is assigned using a sum of multiple factors; rules: SIMSET (Vinod and Sridharan 2008), SPT + total work content on subsequent machine (Holthaus and Rajendrant 1997); -random strategy, in which the random choice of a rule from a defined set is made at each step of the algorithm; rules: SPT vs. the total work-content of jobs in the queue for the next operation on a job (WINQ) (Holthaus and Rajendrant 1997); -hierarchical strategy, in which the algorithm tries to select a job on the basis of a specified primary condition; if no job meets the primary condition, the secondary rule is used; rules: JCR (Kim and Bobrowski 1994), if set Ψ of jobs of which the next operation can be executed immediately is not empty use SPT on Ψ , or else use WINQ on all jobs in the current queue (Holthaus and Rajendrant 1997);…”

Section: Scheduling Methodsmentioning

confidence: 99%

See 1 more Smart Citation

Optimization of setup times in the furniture industry

Gawronski

2012

Ann Oper Res

View full text Add to dashboard Cite

The aim of this paper is to develop a scheduling policy oriented towards minimizing setup times in the made-to-order furniture industry. The task is treated as a dynamic job shop scheduling problem, with the exception that customers' orders collected over a specified period of time are combined into a production plan and released together. A simulation of a production flow based on technological routes of real subassemblies was performed. The proposed method of calculating a setup time eliminates the need to determine machine setup time matrices. Among the tested priority rules the best performance was observed in the case of the hierarchical rule that combines similar setup, the earliest due date and the shortest processing time. This rule allowed the setup time per operation to be reduced by 58 % compared to a combination of the earliest due date with the shortest setup and processing time rule and by over 70 % compared to the single shortest processing time rule.

show abstract

“…One method to increase the production of an industry is to create proper scheduling for the components on the available machines so that the order will complete on time, maximizing the use of the resources and minimizing the average waiting time [2]. Scheduling exists in most manufacturing and production systems, as well as in most information-processing environments.…”

Section: Introductionmentioning

confidence: 99%

Comparison of dispatching rules in job-shop scheduling problem using simulation: a case study

Kaban

Othman

Rohmah

2012

Int. j. simul. model.

View full text Add to dashboard Cite

Industries nowadays must be able to quickly adapt with the customer and improve product quality to survive in the competitive edge. Job shop scheduling is crucial in the manufacturing world and exists within most manufacturing sectors. In the manufacturing world, scheduling problems are extensively implementing the dispatching rules. The procedures are designed to provide good solutions to complex problems in real-time. This paper describes the importance of dispatching rules in improving the performance of the factory. This study evaluates total of44dispatching rules with the classification of hybrid and single rules. The performance of each rule compared and summarized to determine the final ranking for all the different dispatching rules. The result shown that MTWR (Most Total Work Remaining) rule performs well in almost all measurements as well as hybrid dispatching rules is not generating the best rules compared to single dispatching rule. A set of data from an automotive industry use to simulate the job-shop production floor.

show abstract

Dynamic job-shop scheduling with sequence-dependent setup times: simulation modeling and analysis

Cited by 59 publications

References 13 publications

Simulation modeling and analysis of job release policies in scheduling an agile job shop with process sequence dependent setting time

Simulation modeling and analysis of job release policies in scheduling an agile job shop with process sequence dependent setting time

Optimization of setup times in the furniture industry

Comparison of dispatching rules in job-shop scheduling problem using simulation: a case study

Contact Info

Product

Resources

About