1
Views
6
CrossRef citations to date
0
Altmetric
Technical Note

A Heuristic Solution Procedure to Minimize T on a Single Machine

, , &
Pages 293-297 | Published online: 20 Dec 2017

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (2)

BARBAROSÇ. TANSEL, BAHARY. KARA & IHSAN SABUNCUOGLU. (2001) An efficient algorithm for the single machine total tardiness problem. IIE Transactions 33:8, pages 661-674.
Read now
B. L. MACCARTHY & JIYIN LIU. (1993) Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling. International Journal of Production Research 31:1, pages 59-79.
Read now

Articles from other publishers (4)

Tarik Cakar & Rasit Koker. (2015) Solving Single Machine Total Weighted Tardiness Problem with Unequal Release Date Using Neurohybrid Particle Swarm Optimization Approach. Computational Intelligence and Neuroscience 2015, pages 1-13.
Crossref
C. Dimopoulos & A.M.S. Zalzala. (2001) Investigating the use of genetic programming for a classic one-machine scheduling problem. Advances in Engineering Software 32:6, pages 489-498.
Crossref
C. Dimopoulos & A.M.S. Zalzala. (1999) A genetic programming heuristic for the one-machine total tardiness problem. A genetic programming heuristic for the one-machine total tardiness problem.
A. Bauer, B. Bullnheimer, R.F. Hartl & C. Strauss. (1999) An ant colony optimization approach for the single machine total tardiness problem. An ant colony optimization approach for the single machine total tardiness problem.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.