Yu-Hsiang Chung

Learn More
In traditional scheduling problems, the processing time for the given job is assumed to be a constant regardless of whether the job is scheduled earlier or later. However, the phenomenon named ‘‘learning effect’’ has extensively been studied recently, in which job processing times decline as workers gain more experience. This paper discusses a bi-criteria(More)
Deteriorating jobs scheduling has received increasing attention in recent years. However, most researchers focused on regular criteria such as the makespan, and the total (weighted) completion time. However, in many real-life situations, early completion of a job is equally undesirable as its late completion. In such cases, minimizing the quadratic function(More)
We consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. A branch-and-bound algorithm is developed to derive the optimal sequence and two simulated annealing heuristic(More)