MINIMIZING TOTAL WEIGHTED TARDINESS WITH DROP DEAD DATES IN SINGLE MACHINE SCHEDULING PROBLEM

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.

MAHDAVI MAZDEH M.; NAKHJAVANI KH.A.; ZAREEI ABOU ALFAZL

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

Journal Paper

Paper Information

Journal: International Journal of Industrial Engineering & Production Research Year:2010 | Volume:21 | Issue:2 Page(s): 89-95

Download Full-Text

View:

328

Download:

412

Cites:

Information Journal Paper

Title

MINIMIZING TOTAL WEIGHTED TARDINESS WITH DROP DEAD DATES IN SINGLE MACHINE SCHEDULING PROBLEM

Author(s)

MAHDAVI MAZDEH M. | NAKHJAVANI KH.A. | ZAREEI ABOU ALFAZL | Issue Writer Certificate

Keywords

TOTAL WEIGHTED TARDINESS

SINGLE MACHINES

DUE DATE

HEURISTIC ALGORITHMS

Abstract

This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date. The drop dead date is the date in which jobs’ weights rise sharply or the customer cancels the order. A linear programming formulation is developed for the problem and since the problem is known to be NP-hard, three HEURISTIC ALGORITHMS are designed for the problem based on Tabu search mechanism. Extensive numerical experiments were conducted to observe and compare the behavior of the algorithms in solving the problem.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

MAHDAVI MAZDEH, M., NAKHJAVANI, KH.A., & ZAREEI, ABOU ALFAZL. (2010). MINIMIZING TOTAL WEIGHTED TARDINESS WITH DROP DEAD DATES IN SINGLE MACHINE SCHEDULING PROBLEM. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH), 21(2), 89-95. SID. https://sid.ir/paper/556854/en

Vancouver: Copy

MAHDAVI MAZDEH M., NAKHJAVANI KH.A., ZAREEI ABOU ALFAZL. MINIMIZING TOTAL WEIGHTED TARDINESS WITH DROP DEAD DATES IN SINGLE MACHINE SCHEDULING PROBLEM. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH)[Internet]. 2010;21(2):89-95. Available from: https://sid.ir/paper/556854/en

IEEE: Copy

M. MAHDAVI MAZDEH, KH.A. NAKHJAVANI, and ABOU ALFAZL ZAREEI, “MINIMIZING TOTAL WEIGHTED TARDINESS WITH DROP DEAD DATES IN SINGLE MACHINE SCHEDULING PROBLEM,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH), vol. 21, no. 2, pp. 89–95, 2010, [Online]. Available: https://sid.ir/paper/556854/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops