Citations (28)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (1)
Chao-Tang Tseng & Kuan-Han Chen. (2013) An electromagnetism-like mechanism for the single machine total stepwise tardiness problem with release dates. Engineering Optimization 45:12, pages 1431-1448.
Read now
Read now
Articles from other publishers (27)
Ke Chen, T.C.E. Cheng, Hailiang Huang, Min Ji & Danli Yao. (2023) Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs. European Journal of Operational Research 309:1, pages 24-34.
Crossref
Crossref
Wojciech Bożejko, Paweł Rajba, Mariusz Uchroński & Mieczysław Wodecki. (2023) Elimination Properties for a Probabilistic Scheduling Problem. Applied Sciences 13:9, pages 5304.
Crossref
Crossref
Lukáš Hejl, Přemysl Šůcha, Antonín Novák & Zdeněk Hanzálek. (2022) Minimizing the weighted number of tardy jobs on a single machine: Strongly correlated instances. European Journal of Operational Research 298:2, pages 413-424.
Crossref
Crossref
Wojciech Bożejko, Jarosław Pempera, Mariusz Uchroński & Mieczysław Wodecki. 2022. 16th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2021). 16th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2021)
758
765
.
Sachchida Nand Chaurasia, Shyam Sundar & Alok Singh. (2016) Hybrid metaheuristic approaches for the single machine total stepwise tardiness problem with release dates. Operational Research 17:1, pages 275-295.
Crossref
Crossref
Y. Laalaoui & R. M’Hallah. (2016) A binary multiple knapsack model for single machine scheduling with machine unavailability. Computers & Operations Research 72, pages 71-82.
Crossref
Crossref
Arezoo Jafari & Ali Elyasi. (2015) Minimizing the number of tardy jobs in a dynamic flexible flow shop. Minimizing the number of tardy jobs in a dynamic flexible flow shop.
Muminu O. Adamu & Aderemi O. Adewumi. (2014) A survey of single machine scheduling to minimize weighted number of tardy jobs. Journal of Industrial & Management Optimization 10:1, pages 219-241.
Crossref
Crossref
Wojciech Bożejko, Paweł Rajba & Mieczysław Wodecki. 2014. Advanced Methods and Applications in Computational Intelligence. Advanced Methods and Applications in Computational Intelligence
61
77
.
Omar Ghrayeb & Purushothaman Damodaran. (2012) A hybrid random-key genetic algorithm to minimize weighted number of late deliveries for a single machine. The International Journal of Advanced Manufacturing Technology 66:1-4, pages 15-25.
Crossref
Crossref
Mehmet Rustu Taner, Oya Ekin Karasan & Elif Yavuzturk. (2012) Scheduling Beams with Different Priorities on a Military Surveillance Radar. IEEE Transactions on Aerospace and Electronic Systems 48:2, pages 1725-1739.
Crossref
Crossref
M.B. Aryanezhad, A. Jabbarzadeh & A. Zareei. (2009) Combination of Genetic Algorithm and LP-metric to solve single machine bi-criteria scheduling problem. Combination of Genetic Algorithm and LP-metric to solve single machine bi-criteria scheduling problem.
Adam Janiak & Tomasz Krysiak. (2007) Single processor scheduling with job values depending on their completion times. Journal of Scheduling 10:2, pages 129-138.
Crossref
Crossref
Rym M’Hallah & R.L. Bulfin. (2007) Minimizing the weighted number of tardy jobs on a single machine with release dates. European Journal of Operational Research 176:2, pages 727-744.
Crossref
Crossref
Rym M'Hallah & R.L. Bulfin. (2005) Minimizing the weighted number of tardy jobs on parallel processors. European Journal of Operational Research 160:2, pages 471-484.
Crossref
Crossref
Marc Sevaux & Stéphane Dauzère-Pérès. (2003) Genetic algorithms to minimize the weighted number of late jobs on a single machine. European Journal of Operational Research 151:2, pages 296-306.
Crossref
Crossref
Stéphane Dauzère‐Pérès & Marc Sevaux. (2002) Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine. Naval Research Logistics (NRL) 50:3, pages 273-288.
Crossref
Crossref
Rym M’Hallah & R.L Bulfin. (2003) Minimizing the weighted number of tardy jobs on a single machine. European Journal of Operational Research 145:1, pages 45-56.
Crossref
Crossref
Nipa Phojanamongkolkij, Doyglas Grabenstetter & Omar Ghrayeb. (2003) Scheduling jobs to improve weighted on-time performance of a single machine. Journal of Manufacturing Systems 22:2, pages 148-156.
Crossref
Crossref
Gordon, Finke & Proth. (2002) Scheduling with due dates and deadlines. Scheduling with due dates and deadlines.
Bo Chen, Chris N. Potts & Gerhard J. Woeginger. 1999. Handbook of Combinatorial Optimization. Handbook of Combinatorial Optimization
1493
1641
.
Jatinder N.D. Gupta & Johnny C. Ho. (1996) Scheduling with two job classes and setup times to minimize the number of tardy jobs. International Journal of Production Economics 42:3, pages 205-216.
Crossref
Crossref
Johnny C. Ho & Yih-Long Chang. (1995) Minimizing the number of tardy jobs for m parallel machines. European Journal of Operational Research 84:2, pages 343-355.
Crossref
Crossref
Chung-Lun Li, T.C.E. Cheng & Z.-L. Chen. (1995) Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs. Computers & Operations Research 22:2, pages 205-219.
Crossref
Crossref
Reha Uzsoy, Chung-Yee Lee & Louis A. Martin-Vega. (1992) Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine. Naval Research Logistics 39:3, pages 369-388.
Crossref
Crossref
Prabuddha De, Jay B. Ghosh & Charles E. Wells. (1992) Optimal due-date assignment and sequencing. European Journal of Operational Research 57:3, pages 323-331.
Crossref
Crossref
Guochun Tang. (1990) A new branch and bound algorithm for minimizing the weighted number of tardy jobs. Annals of Operations Research 24:1, pages 225-232.
Crossref
Crossref