A new model for the preemptive earliness–tardiness scheduling problem

A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem

“…We can also have earliness and tardiness scheduling model (13). Actually the earliness/tardiness objectives are often used in the scheduling problem.…”

“…In flow shop scheduling literature, there are numerous papers that have investigated these problems [1,13,19,30]. Most research is dedicated to single-criterion problems.…”

A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem

“…This problem may be solved in OðnlognÞ time by sorting the operations in non-decreasing order of their ready times and then scheduling any unit job that is available as early as possible. A similar reasoning for the planning horizon is applied by Runge and Sound [19] in order to compute a valid lower bound for a preemptive single-machine E/T scheduling problem based on the transportation problem. Second, very large instances of the transportation problem can be solved very effectively by standard solvers and the single-machine instances derived from JS-TWT in our computational study do not have more than 20 jobs.…”

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

“…By using local search algorithm and a branch-and-bound procedure, the authors showed there is a very small gap between their results and optimum solutions. Runge and Sourd (2009) addressed a new model for the single machine E/T scheduling problem where preemption is allowed. In this model, presented interruption costs are based on the WIP of the job.…”