2005
DOI: 10.1016/j.cie.2005.06.005
|View full text |Cite
|
Sign up to set email alerts
|

Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
32
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 71 publications
(32 citation statements)
references
References 39 publications
0
32
0
Order By: Relevance
“…Encouraging results were reported for both approaches; however, no comparison with alternative multiobjective optimization techniques was attempted. Thiagarajan 96 addresses the problem of scheduling in dynamic assembly job-shops with the consideration of jobs having different earliness, tardiness and holding costs. In the first phase of the study, relative costs, earliness and tardiness of jobs are considered, and the dispatching rules are presented in order to minimize the sum of weighted earliness and weighted tardiness of jobs.…”
Section: Background On Multi-criteria Scheduling (Job-shop)mentioning
confidence: 99%
“…Encouraging results were reported for both approaches; however, no comparison with alternative multiobjective optimization techniques was attempted. Thiagarajan 96 addresses the problem of scheduling in dynamic assembly job-shops with the consideration of jobs having different earliness, tardiness and holding costs. In the first phase of the study, relative costs, earliness and tardiness of jobs are considered, and the dispatching rules are presented in order to minimize the sum of weighted earliness and weighted tardiness of jobs.…”
Section: Background On Multi-criteria Scheduling (Job-shop)mentioning
confidence: 99%
“…Most studies on due-date based scheduling assume uniform distribution of due dates. However, in real production system, this assumption does not always hold true (Thiagarajan and Rajendran, 2005). Sourd (2005) presented a different method for generating due dates that defines the interval bounds in which due dates belong.…”
Section: The Data Set and The Objective Functionmentioning
confidence: 99%
“…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. Thiagarajan and Rajendran [4] present another simulation study of a dynamic assembly shop. They present dispatching rules for minimizing the sum of weighted tardiness and earliness, and the sum of weighted tardiness, earliness, and flow time.…”
Section: Introductionmentioning
confidence: 99%