Advanced search
Publication Cover
IIE Transactions Volume 33, 2001 - Issue 8
Submit an article Journal homepage
69
Views
13
CrossRef citations to date
0
Altmetric
Original Articles

An efficient algorithm for the single machine total tardiness problem

BARBAROS Ç. TANSEL Department of Industrial Engineering, Bilkent University, Bilkent, Ankara, 06533, Turkey
,
BAHAR Y. KARA Department of Industrial Engineering, Bilkent University, Bilkent, Ankara, 06533, Turkey
&
IHSAN SABUNCUOGLU Department of Industrial Engineering, Bilkent University, Bilkent, Ankara, 06533, Turkey
Pages 661-674 | Received 01 Nov 1999, Accepted 01 Nov 2000, Published online: 27 Apr 2007

Citations (13)

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

Subscribe to citation updates

Read on this site (1)

Wei Sun, Yang Yu, Qi Lou, Junwei Wang & Yuechao Guan. (2020) Reducing the total tardiness by Seru production: model, exact and cooperative coevolution solutions. International Journal of Production Research 58:21, pages 6441-6452.
Read now

Articles from other publishers (12)

Xiangyi Zhang & Lu Chen. (2022) A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance. Computers & Operations Research 143, pages 105738.
Crossref
Shengsheng Niu, Shiji Song, Jian-Ya Ding, Yuli Zhang & Raymond Chiong. (2019) Distributionally robust single machine scheduling with the total tardiness criterion. Computers & Operations Research 101, pages 13-28.
Crossref
Alexander Anatolievich Pavlov, Elena Borisovna Misura, Oleg Valentinovich Melnikov & Iryna Pavlovna Mukha. 2019. Advances in Computer Science for Engineering and Education. Advances in Computer Science for Engineering and Education 429 436 .
Khaled S. Abdallah & Jaejin Jang. (2017) Scheduling a single machine with job family setup times to minimize total tardiness. Scheduling a single machine with job family setup times to minimize total tardiness.
Andrew Junfang Yu & Javad Seif. (2016) Minimizing tardiness and maintenance costs in flow shop scheduling by a lower-bound-based GA. Computers & Industrial Engineering 97, pages 26-40.
Crossref
John J. Kanet. (2014) One-Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons. Operations Research 62:2, pages 345-347.
Crossref
Shuyu Zhou & Zhaohui Liu. (2013) A theoretical development for the total tardiness problem and its application in branch and bound algorithms. Computers & Operations Research 40:1, pages 248-252.
Crossref
Christos Koulamas. (2010) The single-machine total tardiness scheduling problem: Review and extensions. European Journal of Operational Research 202:1, pages 1-7.
Crossref
Shunji Tanaka & Mituhiko Araki. (2008) A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines. International Journal of Production Economics 113:1, pages 446-458.
Crossref
J. J. Kanet. (2007) New Precedence Theorems for One-Machine Weighted Tardiness. Mathematics of Operations Research 32:3, pages 579-588.
Crossref
Chia-Shin Chung, James Flynn & Ömer Kirca. (2006) A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems. European Journal of Operational Research 174:1, pages 1-10.
Crossref
G. Celano, A. Costa & S. Fichera. (2002) Constrained scheduling of jobs with different due dates in a flowshop. Constrained scheduling of jobs with different due dates in a flowshop.

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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.