Scheduling rules for dynamic shops that manufacture multi-level jobs

Sundaram, K. Mohana; Natarajan, K.; Viswanathkumar, G.; Radhakrishnan, P.; Rajendran, Chandrasekharan

doi:10.1016/s0360-8352(02)00188-2

Cited by 50 publications

(16 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Mohanasundaram, Nararajan, Viswanathkumar, Radhakrishnan, and Rajendran [8] discussed notions including total work content, relative remaining processing time, earliest completion time (ECT), and latest finish time (FT). They tested composite rules on job shops at 80% and 90% utilization in order to minimize measures related to flow time and due dates.…”

Section: Static and Dynamic Job Shop Problemsmentioning

confidence: 99%

“…Earlier studies [8,10,14] have combined various scheduling considerations to build contextual information into searches. The present research seeks to incorporate contextual information, such as ant index and tour, into the arguments of functions.…”

Section: The Context-dependent Functions Ft Mit and Jwtmentioning

confidence: 99%

“…P avg denoted the average processing time per job; P avg was calculated as the product of the average processing time per operation and the average number of operations per job. The processing time per operation was always determined by a rectangular distribution with a mean of 5.5 min; three functions were used, namely: U(1,10), U (3,8), U (5,6). Number of operations per job had three different rectangular distributions with three different pairs of mean and P avg values: U(6,6) had a mean of 6 and a P avg of 1,980 s; U(4,6) had a mean of 5 and a P avg of 1,650 s; and U(2,6) had a mean of 4 and a P avg of 1,320 s. Utilization was denoted U and was defined as U = (P avg )/(6*λ) where 6 was the number of machines and λ was the exponential inter-arrival time parameter.…”

Section: A Stochastic Scheduling Simulationmentioning

confidence: 99%

“…Prior studies [8,10,14,17] developed contextual notions such as ECT, TLM, and multi-heuristic desirability, to avoid myopic solutions. These prior context-dependent studies compared their approaches to standard rules such as SPT, LPT, LWR, MWR, and FIFO [6,7,10,13,14,22].…”

Section: Relevance To Prior Researchmentioning

confidence: 99%

See 3 more Smart Citations

Multi-contextual ant colony optimization of intermediate dynamic job shop problems

Romanowski

2011

Int J Adv Manuf Technol

View full text Add to dashboard Cite

Myopic scheduling uses information without correct context. Because job shops with dynamic job arrival are NP-hard, real-world planners often resort to myopic dispatching rules that produce schedules with unsatisfactory makespans and mean flow times. If metaheuristic scheduling does not use context properly, it can produce unsatisfactory schedules. This study proposes a new theory of context-dependent and multi-contextual scheduling functions in dynamic job shops. Three multi-contextual ant colony (MCAC) scheduling methods, SPT_MIT_JWT, MRT_MIT, and LRT_MIT_JWT, were designed to combine several context-dependent functions so that each ant had an independent, artificially intelligent model of what might happen in the future. These three MCACs scheduled 27 dynamic job shops. Each job shop had three parameters (number of operations per job, processing time per operation, and utilization level) at one of three levels. The results were compared to schedules from dispatching rules. Schedules from MRT_MIT had the best makespans for all 27 combinations of factors. For five cases in which utilization and operations per job were both high, schedules from longest processing time had the best mean flow time; in the other 22 cases, either SPT_MIT_JWT or LRT_MIT_JWT produced the schedule with the best mean flow time. These results indicate that the new theory can be used to design multi-contextual methods that produce effective schedules.

show abstract

Section: Static and Dynamic Job Shop Problemsmentioning

confidence: 99%

Section: The Context-dependent Functions Ft Mit and Jwtmentioning

confidence: 99%

Section: A Stochastic Scheduling Simulationmentioning

confidence: 99%

Section: Relevance To Prior Researchmentioning

confidence: 99%

See 2 more Smart Citations

Multi-contextual ant colony optimization of intermediate dynamic job shop problems

Romanowski

2011

Int J Adv Manuf Technol

View full text Add to dashboard Cite

show abstract

“…However, most practitioners will benefit if a small set of scheduling rules that are easy to apply can be shown to be effective, with respect to commonly used performance metrics, under a range of job-shop environments. Mohanasundaram et al [3] present a simulation study of a dynamic assembly shop. They present scheduling rules for minimizing the maximum standard deviation of flow time and staging delay and the maximum conditional tardiness and standard deviation of conditional tardiness.…”

Section: Introductionmentioning

confidence: 99%

Scheduling rules for a small dynamic job-shop: a simulation approach

Dileepan¹,

Ahmadi²

2010

Int. j. simul. model.

View full text Add to dashboard Cite

The objective of this paper is to study a selected set of scheduling criteria commonly used in scheduling research and develop a set of simple rules that can be easily implemented in relatively small dynamic job-shops. Simulation models were developed for two dynamic production shop environments, namely, a job-shop with jumbled flow and a job-shop with limited jumbled flow. Five scheduling criteria were used with each of the three models. They are, (i) Slack per Remaining Operations (SPRO), (ii) Priority Ratio (PR), (iii) Earliest Due Date (EDD), (iv) Total Work Content Remaining (TWKR), and (v) Smallest Processing Time (SPT). In each of these cases, performance statistics relating to work-in-process (WIP) inventory and job lateness were gathered. The results show that in most cases, simple rules such as SPT and EDD outperform the other rules. SPT rule minimizes the performance metrics that measure WIP inventory levels and the EDD rule minimizes the performance metrics that measure deviation of job completion time from the promised due date.

show abstract

Literature Review and Research Objectives

Karam

2015

Springer Theses

View full text Add to dashboard Cite

Scheduling rules for dynamic shops that manufacture multi-level jobs

Cited by 50 publications

References 15 publications

Multi-contextual ant colony optimization of intermediate dynamic job shop problems

Multi-contextual ant colony optimization of intermediate dynamic job shop problems

Scheduling rules for a small dynamic job-shop: a simulation approach

Literature Review and Research Objectives

Contact Info

Product

Resources

About