Minimizing the Number of Tardy Jobs on Single Machine Scheduling with Flexible Maintenance Time

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.

GANJI FATEMEH; Jamali Amir

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

Journal Paper

Paper Information

Journal: JOURNAL OF ALGORITHMS AND COMPUTATION Year:2018 | Volume:50 | Issue:2 Page(s): 103-119

Download Full-Text

View:

175

Download:

276

Cites:

Information Journal Paper

Title

Minimizing the Number of Tardy Jobs on Single Machine Scheduling with Flexible Maintenance Time

Author(s)

GANJI FATEMEH | Jamali Amir | Issue Writer Certificate

Keywords

Scheduling

Single machine

Flexible mainte-nance

Tardy job

Abstract

In this study, Single machine Scheduling with exible maintenance is investigated with non-resumable jobs by minimizing the weighted number of Tardy jobs. It is assumed that the machine stops for a constant interval time during the Scheduling period to perform mainte-nance. In other words, the starting time of maintenance is the decision variable. By reviewing the literature, we noticed that this problem has not been studied yet. Ini-tially, it is proved that the problem is NP-hard. Then, a mathematical model is proposed and solved by the GAMS software. Because of the long time for solving the problem with an exact method, we develop a heuris-tic algorithm.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

GANJI, FATEMEH, & Jamali, Amir. (2018). Minimizing the Number of Tardy Jobs on Single Machine Scheduling with Flexible Maintenance Time. JOURNAL OF ALGORITHMS AND COMPUTATION, 50(2), 103-119. SID. https://sid.ir/paper/354566/en

Vancouver: Copy

GANJI FATEMEH, Jamali Amir. Minimizing the Number of Tardy Jobs on Single Machine Scheduling with Flexible Maintenance Time. JOURNAL OF ALGORITHMS AND COMPUTATION[Internet]. 2018;50(2):103-119. Available from: https://sid.ir/paper/354566/en

IEEE: Copy

FATEMEH GANJI, and Amir Jamali, “Minimizing the Number of Tardy Jobs on Single Machine Scheduling with Flexible Maintenance Time,” JOURNAL OF ALGORITHMS AND COMPUTATION, vol. 50, no. 2, pp. 103–119, 2018, [Online]. Available: https://sid.ir/paper/354566/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops