Dispatching rules for scheduling in assembly jobshops - Part 2
Citations
13,333 citations
85 citations
85 citations
Cites methods from "Dispatching rules for scheduling in..."
...A simulation approach is used as in many previous studies (Maxwell and Mehra 1968, Maxwell 1969, Adam et al. 1987, Ragatz and Mabert 1988, Melnyk and Ragatz 1989, Ramasech 1990, Reeja and Rajendran 2000a, b, Sabuncuoglu and Karapinar 2000, Vinod and Sridharan 2009)....
[...]
83 citations
Cites background from "Dispatching rules for scheduling in..."
...Reeja and Rajendran (2000) stated that most research on job shop scheduling problems ignored assembly relationships arising from product structure....
[...]
37 citations
References
13,333 citations
72 citations
"Dispatching rules for scheduling in..." refers background or methods in this paper
...Maxwell and Mehra (1968) considered single-level assembly jobs and assigned due dates to arriving jobs by using the information on the arrival time and due date of the job, the maximum total processing time among segments and the maximum number of operations of a segment among all segments....
[...]
...…work dealing with either the development of dispatching rules or due date setting methodologies in assembly jobshops has been carried out by Maxwell and Mehra (1968), Maxwell (1969), Goodwin and Goodwin (1982), Siegel (1971), Huang (1984), Sculli (1987), Russell and Taylor (1985) , Fry et…...
[...]
...Maxwell and Mehra (1968) experimented with multilevel s̀ymmetric tree structured’ jobs....
[...]
...Suppose that the due date of a job is set by using the total processing time of items/components on the critical path, and is calculated using equation (1) (see also Maxwell and Mehra 1968, Adam et al. 1993)....
[...]
58 citations
"Dispatching rules for scheduling in..." refers background or methods in this paper
...…methodologies in assembly jobshops has been carried out by Maxwell and Mehra (1968), Maxwell (1969), Goodwin and Goodwin (1982), Siegel (1971), Huang (1984), Sculli (1987), Russell and Taylor (1985) , Fry et al. (1989), Philipoom et al. (1991), Adam et al. (1993) , and Roman and del Valle (1996)....
[...]
...Later, Philipoom et al. (1991) proposed a new set of sequencing rule called the importance ratio (IR) rules and evaluated them with respect to four measures of tardiness....
[...]
56 citations
"Dispatching rules for scheduling in..." refers background or methods in this paper
...Some of the rules which were evaluated were [IR ; WKR (total work content remaining)], IR-SLK(slack), MS (modi® ed slack)-IR, and MS-TWK rule. The (IR ; TWKR) rule performed well with respect to mean ̄ owtime and per cent tardy jobs. The results suggested that (IR ; TWKR) rule is more appropriate for scheduling assembly jobs than any of the other rules tested. Adam et al. (1993) presented a study on the due date assignment procedures in jobshop environments where multi-level assembly jobs were processed and due dates were internally assigned....
[...]
...They used the total work content (TWK), in which the allowance of a job was in proportion to its total processing time and the predetermined constant lead time allowance (CON), where the allowance of individual jobs was set equal to a constant representing the average lead time of a job in the shop. Huang (1984) explored the impact of the various rules on the performance of the shop....
[...]
54 citations