Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds

Upper Bounds ◽

Scheduling Problem ◽

Lower And Upper Bounds ◽

Number Of Tardy Jobs ◽

Single machine scheduling problem of minimising weighted sum of maximum weighted earliness and weighted number of tardy jobs

International Journal of Manufacturing Research ◽

10.1504/ijmr.2021.115558 ◽

2021 ◽

Vol 16 (2) ◽

pp. 154

Author(s):

Parvaneh Eghbalpor ◽

Mohammad Reisi Nafchi ◽

Ghasem Moslehi

Keyword(s):

Single Machine ◽

Machine Scheduling ◽

Weighted Sum ◽

Scheduling Problem ◽

Number Of Tardy Jobs ◽

Weighted Number ◽

Weighted Earliness ◽

Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem

Computers & Mathematics with Applications ◽

10.1016/j.camwa.2010.09.046 ◽

2010 ◽

Vol 60 (11) ◽

pp. 2909-2919 ◽

Cited By ~ 11

Author(s):

Ehsan Molaee ◽

Ghasem Moslehi ◽

Mohammad Reisi

Keyword(s):

Single Machine ◽

Machine Scheduling ◽

Scheduling Problem ◽

Number Of Tardy Jobs ◽

Maximum Earliness ◽

The single-machine scheduling problem to minimize total tardiness subject to minimum number of tardy jobs

IIE Transactions ◽

10.1080/07408179508936738 ◽

1995 ◽

Vol 27 (2) ◽

pp. 250-256 ◽

Cited By ~ 17

Author(s):

GEORGE L. VAIRAKTARAKIS ◽

CHUNG-YEE LEE

Keyword(s):

Single Machine ◽

Machine Scheduling ◽

Total Tardiness ◽

Scheduling Problem ◽

Number Of Tardy Jobs ◽

Minimum Number ◽

Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint

Computers & Mathematics with Applications ◽

10.1016/j.camwa.2011.09.016 ◽

2011 ◽

Vol 62 (9) ◽

pp. 3622-3641 ◽

Cited By ~ 6

Author(s):

Ehsan Molaee ◽

Ghasem Moslehi ◽

Mohammad Reisi

Keyword(s):

Single Machine ◽

Machine Scheduling ◽

Scheduling Problem ◽

Availability Constraint ◽

Number Of Tardy Jobs ◽

Maximum Earliness ◽

Single machine scheduling problem of minimizing maximum earliness and number of tardy jobs using a genetic algorithm

2011 International Conference of Soft Computing and Pattern Recognition (SoCPaR) ◽

10.1109/socpar.2011.6089277 ◽

2011 ◽

Cited By ~ 1

Author(s):

Afshin Kazerooni ◽

Morteza Saedi Dezaki ◽

Reza Ebrahimpour

Keyword(s):

Genetic Algorithm ◽

Single Machine ◽

Machine Scheduling ◽

Scheduling Problem ◽

Number Of Tardy Jobs ◽

Maximum Earliness ◽

Single machine scheduling problem of minimising weighted sum of maximum weighted earliness and weighted number of tardy jobs

International Journal of Manufacturing Research ◽

10.1504/ijmr.2021.10038372 ◽

2021 ◽

Vol 16 (2) ◽

pp. 154

Author(s):

Parvaneh Eghbalpor ◽

Mohammad Reisi Nafchi ◽

Ghasem Moslehi

Keyword(s):

Single Machine ◽

Machine Scheduling ◽

Weighted Sum ◽

Scheduling Problem ◽

Number Of Tardy Jobs ◽

Weighted Number ◽

Weighted Earliness ◽

Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs

Applied Mathematics and Computation ◽

10.1016/j.amc.2007.04.063 ◽

2007 ◽

Vol 194 (2) ◽

pp. 552-560 ◽

Cited By ~ 15

Author(s):

Fariborz Jolai ◽

M. Rabbani ◽

S. Amalnick ◽

A. Dabaghi ◽

M. Dehghan ◽

...

Keyword(s):

Genetic Algorithm ◽

Single Machine ◽

Machine Scheduling ◽

Scheduling Problem ◽

Number Of Tardy Jobs ◽

Maximum Earliness ◽

Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance

Computers & Operations Research ◽

10.1016/j.cor.2011.11.002 ◽

2012 ◽

Vol 39 (9) ◽

pp. 2196-2205 ◽

Cited By ~ 33

Author(s):

Ju-Yong Lee ◽

Yeong-Dae Kim

Keyword(s):

Single Machine ◽

Machine Scheduling ◽

Scheduling Problem ◽

Number Of Tardy Jobs ◽

Periodic Maintenance ◽

Springer Proceedings in Mathematics & Statistics - Models, Algorithms, and Technologies for Network Analysis ◽

Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times

10.1007/978-1-4614-8588-9_2 ◽

2013 ◽

pp. 11-27 ◽

Cited By ~ 1

Author(s):

Mikhail Batsyn ◽

Boris Goldengorin ◽

Pavel Sukhov ◽

Panos M. Pardalos

Keyword(s):

Single Machine ◽

Machine Scheduling ◽

Upper Bounds ◽

Scheduling Problem ◽

Lower And Upper Bounds ◽

Processing Times ◽

Equal Processing Times

Algorithms for a two-agent single machine scheduling problem to minimize weighted number of tardy jobs

Journal of Information and Optimization Sciences ◽

10.1080/02522667.2020.1816637 ◽

2020 ◽

pp. 1-27

Author(s):

Jiaji Li ◽

Yuvraj Gajpal ◽

Srimantoorao S. Appadoo

Keyword(s):

Single Machine ◽

Machine Scheduling ◽

Scheduling Problem ◽

Number Of Tardy Jobs ◽

Weighted Number ◽