Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs

Scheduling single-machine problem oriented by Just-in-Time principles — A case study

“…Dispatching rules, however tend to yield a low and unpredictable performance. For some simple scheduling problems, efficient algorithms do exist to calculate the optimal solutions [1,8,13,23,31].…”

“…Performance measures can be generally classified as external or costumer-oriented (measures related to the client, such as lead times or due dates) [8][9][10][11] or internal or enterpriseoriented, such as makespan, total completion time, and earliness among others [12][13][14][15][16]. Both types of performance measures are important to be considered, and can be treated jointly, under the principles of the Just-in-Time (JIT) philosophy [19][20][21][22][23]. The Just-in-Time philosophy tries to minimize the earliness and the lateness at the same time.…”

“…Therefore, single-machine scheduling problems are also important while trying to solve more complex ones, as the solution for the whole complex scheduling problem can be found through a decomposition [3,[5][6][7]. Many studies have been carried out over decades about SMSP [8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23]. In these problems not only the assumptions and specificities can be different, but also the objective that is intended to be analysed, which can led to quite difficult problems to solve [8, 11-16, 22, 23].…”

A survey on scheduling problems with due windows

“…Hoogeveen 2005 for details). Some of these problems consist in minimizing one objective (e.g., the sum of earliness penalties) subject to some constraints on other objectives (e.g., the sum of tardiness penalties), see e.g., Wan and Yen (2009), Cheng, Tadikamalla, Shang, and Zhang (2014).…”

Just-in-time preemptive single machine problem with costs of earliness/tardiness, interruption and work-in-process

“…A sequence-independent setup time is required to process a job from a different family. Wan and Yen (2009) considered a single machine scheduling problem to minimize the total weighted earliness subject to minimum number of tardy jobs. They developed a heuristic and a branch and bound algorithm and compared these two algorithms for problems in different sizes.…”