SOLVING THE SINGLE MACHINE PROBLEM WITH QUADRATIC EARLINESS AND TARDINESS PENALTIES

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.

KIANFAR KAMRAN; MOSLEHI GHASEM

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN) Year:2011 | Volume:22 | Issue:3 Page(s): 263-272

Download Full-Text

Persian Verion

View:

756

Download:

Cites:

Information Journal Paper

Title

SOLVING THE SINGLE MACHINE PROBLEM WITH QUADRATIC EARLINESS AND TARDINESS PENALTIES

Author(s)

KIANFAR KAMRAN | MOSLEHI GHASEM | Issue Writer Certificate

Keywords

SCHEDULINGQ2

SINGLE MACHINEQ2

QUADRATIC EARLINESS AND TARDINESSQ2

BRANCH AND BOUNDQ2

Abstract

Nowadays, SCHEDULING problems have a considerable application in production and service systems. In this paper, we consider the SCHEDULING of n jobs on a SINGLE MACHINE assuming no machine idleness, non-preemptive jobs and equal process times. In many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combinations in objective functions. However, minimizing the weighted QUADRATIC EARLINESS AND TARDINESS penalties is considered in this paper. A BRANCH AND BOUND algorithm including some dominance rules, lower bounds and upper bounds is proposed to solve the problem. Finally, the efficiency of proposed method is proved via some test problems.

Cites

No record.

References

No record.

Cite

APA: Copy

KIANFAR, KAMRAN, & MOSLEHI, GHASEM. (2011). SOLVING THE SINGLE MACHINE PROBLEM WITH QUADRATIC EARLINESS AND TARDINESS PENALTIES. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 22(3), 263-272. SID. https://sid.ir/paper/66021/en

Vancouver: Copy

KIANFAR KAMRAN, MOSLEHI GHASEM. SOLVING THE SINGLE MACHINE PROBLEM WITH QUADRATIC EARLINESS AND TARDINESS PENALTIES. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2011;22(3):263-272. Available from: https://sid.ir/paper/66021/en

IEEE: Copy

KAMRAN KIANFAR, and GHASEM MOSLEHI, “SOLVING THE SINGLE MACHINE PROBLEM WITH QUADRATIC EARLINESS AND TARDINESS PENALTIES,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 22, no. 3, pp. 263–272, 2011, [Online]. Available: https://sid.ir/paper/66021/en

Related Journal Papers