—Bi- or multi-objective scheduling problem is
important in practice because it offers two and more
managerial indicators simultaneously for decision-makers
doing some trade-offs. To date the studies of single
batch-processing machine problems with bi-criteria were
relatively few compared to the single unit-processing machine.
In this paper, we consider a bi-criteria scheduling problem of
minimizing the makespan and total weighted tardiness on a
single batch-processing machine. An exhausted enumeration
approach is provided to find all Pareto-optimal solutions for
small-scale problems. In addition, an alternative method called
SA-based multi-objective (SAMO) algorithm is also developed
for comparison with the exhausted enumeration approach.
Computational results revealed that the proposed SAMO
algorithm could almost find all Pareto-optimal solutions for the
small problem. Obviously, the success on small-scale problems
suggests the readiness of the proposed SA for large-scale
—Makespan, total weighted tardiness,
batch-processing machine, simulated annealing.
Hui-Mei Wang is with the Department of Industrial Management,
Vanung University, Jung-Li, Tao-Yuan, Taiwan (e-mail:
Fuh-Der Chou is with the Department of Industrial Management, Chien
Hsin University, Jung-Li, Tao-Yuan, Taiwan (tel.:+886-3-4581196-6103;
fax: +886-3-2503908; e-mail: email@example.com ).
Cite:Hui-Mei Wang and Fuh-Der Chou, "Bi-Criteria Single Batch-Processing Machine with Job Release Time and Non-Identical Job Sizes," International Journal of Information and Education Technology vol. 3, no. 5, pp. 536-539, 2013.