In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. We propose a lower bounding procedure based on the relaxation of the jobs' completion times. Optimal branch-and-bound algorithms are then presented....

This paper considers the order scheduling problem to minimize total tardiness. The system is composed of multiple machines, and each order consists of multiple components, with each component being manufactured on a dedicated machine (specified in advance). The completion time of each order is...

We study a two-machine flowshop scheduling problem with time-dependent deteriorating jobs, i.e. the processing times of jobs are an increasing function of their starting time. The objective is to minimize the total completion time subject to minimum makespan. We propose a mixed integer...