NEW SCHEDULING RULES FOR A DYNAMIC FLEXIBLE FLOW LINE PROBLEM WITH SEQUENCE-DEPENDENT SETUP TIMES

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

KIA HAMIDREZA; GHODSYPOUR SEYED HASSAN; DAVOUD POUR HAMID

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2017 | Volume:13 | Issue:3 Page(s): 297-306

Download Full-Text

View:

204

Download:

143

Cites:

Information Journal Paper

Title

NEW SCHEDULING RULES FOR A DYNAMIC FLEXIBLE FLOW LINE PROBLEM WITH SEQUENCE-DEPENDENT SETUP TIMES

Author(s)

KIA HAMIDREZA | GHODSYPOUR SEYED HASSAN | DAVOUD POUR HAMID | Issue Writer Certificate

Keywords

SCHEDULING

DYNAMIC FLEXIBLE FLOW LINE

SIMULATION

HEURISTICS

GENETIC PROGRAMMING

Abstract

In the literature, the application of multi-objective dynamic SCHEDULING problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a DYNAMIC FLEXIBLE FLOW LINE problem with sequence-dependent setup times is studied. The objective of the problem is minimization of mean flow time and mean tardiness.A 0–1 mixed integer model of the problem is formulated.Since the problem is NP-hard, four new composite dispatching rules are proposed to solve it by applying GENETIC PROGRAMMING framework and choosing proper operators.Furthermore, a discrete-event SIMULATION model is made to examine the performances of SCHEDULING rules considering four new heuristic rules and the six adapted heuristic rules from the literature. It is clear from the experimental results that composite dispatching rules that are formed from GENETIC PROGRAMMING have a better performance in minimization of mean flow time and mean tardiness than others.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

KIA, HAMIDREZA, GHODSYPOUR, SEYED HASSAN, & DAVOUD POUR, HAMID. (2017). NEW SCHEDULING RULES FOR A DYNAMIC FLEXIBLE FLOW LINE PROBLEM WITH SEQUENCE-DEPENDENT SETUP TIMES. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 13(3), 297-306. SID. https://sid.ir/paper/310108/en

Vancouver: Copy

KIA HAMIDREZA, GHODSYPOUR SEYED HASSAN, DAVOUD POUR HAMID. NEW SCHEDULING RULES FOR A DYNAMIC FLEXIBLE FLOW LINE PROBLEM WITH SEQUENCE-DEPENDENT SETUP TIMES. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2017;13(3):297-306. Available from: https://sid.ir/paper/310108/en

IEEE: Copy

HAMIDREZA KIA, SEYED HASSAN GHODSYPOUR, and HAMID DAVOUD POUR, “NEW SCHEDULING RULES FOR A DYNAMIC FLEXIBLE FLOW LINE PROBLEM WITH SEQUENCE-DEPENDENT SETUP TIMES,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 13, no. 3, pp. 297–306, 2017, [Online]. Available: https://sid.ir/paper/310108/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops