Abstract
We consider the problem of scheduling jobs on parallel, identical machines so as to minimize a primary and a secondary criteria. All the jobs are assumed to have identical processing times. Polynomial time algorithms, that generate optimal solutions, are presented for various combinations of primary and secondary criteria.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Azizoglu and S.O. Kondacki, “Bicriteria scheduling problem involving total tardiness and total earliness penalties,” International Journal of Production Economics, vol. 23, no. 1-3, 1991.
R. Bausch, “Multicriteria scheduling tool using a branch and bound algorithm,” European Journal of Operational Research, vol. 61, no. 1/2, pp. 213–218, 1992.
A.A. Cenna and M.T. Tabucanon, “Bicriteria scheduling problem in a job shop with parallel processors,” International Journal of Production Economics, vol. 25, no. 1-3, pp. 95–101, 1991.
S. Chand and Schneeberger, “A note on single machine scheduling problem with minimum weighted completion time and maximum allowable tardiness,” Naval Research Logistics Quarterly, vol. 33, no. 3, pp. 551–557, 1986.
C.L. Chen and R.L. Bulfin, “Scheduling unit processing time jobs on a single machine with multiple criteria,” Computers and Operations Research, vol. 17, pp. 1–17, 1989.
C.-L. Chen, and R.L. Bulfin, “Complexity of single machine, multi-criteria scheduling problems,” European Journal of Operational Research, vol. 70, pp. 115–125, 1993.
C.-L. Chen and R.L. Bulfin, “Scheduling a single machine to minimize two criteria: Max tardiness and number of tardy jobs,” IIE Transactions, vol. 26, pp. 76–84, 1994.
T.C.E. Cheng, “Minimizing the flow time and missed due dates in a single machine sequencing,” Mathematical & Computer Modelling, vol. 13, no. 5, pp. 71–77, 1990.
T.C.E. Cheng, “Improve solution procedure for n/1/max {γ(C)} → ∑ Cscheduling problem},” Journal of Operations Research Society, vol. 42, no. 5, pp. 413–417, 1991.
R.L. Daniels, “Incorporating preference information into multi-objective scheduling,” European Journal of Operational Research, vol. 77, pp. 272–286, 1994.
P. De, J.B. Ghosh, and C.E.Wells, “Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine,” Computer and Operations Research, vol. 18, no. 8, pp. 717–720, 1991.
P. Dileepan and T. Sen, “Bicriteria job shop scheduling with flowtime and sum square of lateness,” Engineering Cost and Production Economics, vol. 21, no. 3, pp. 295–299, 1991.
T.D. Fry, R.D. Armstrong, and H. Lemis, “Aframework for single machine multiple objective sequencing research,” Omega, vol. 17, pp. 595–607, 1989.
B. Grabot and L. Geneste, “Dispatching rules in scheduling:Afuzzy approach,” International Journal of Production Research, vol. 32, no. 4, pp. 903–915, 1994.
T.J. Hodgson and G.W. McDonald, “Interactive scheduling of a generalized flow shop, Part I: Success through evolutionary development,” Interfaces, vol. 11, no. 2, pp. 42–47, 1981.
J.A. Hoogeveen, “Minimizing maximum promptness and maximum lateness on a single machine,” Mathematics of Operations Research, vol. 21, pp. 100–114, 1996a.
J.A. Hoogeveen, “Single machine scheduling to minimize a function of two or three maximum cost criteria,” Journal of Algorithms, vol. 21, pp. 415–435, 1996b.
J.A. Hoogeveen and S.L. van de Velde, “Minimizing total completion time and maximum cost simultaneously,” Operations Research Letters, vol. 17, pp. 205–208, 1995.
K.S. Lin, “Hybrid algorithm for sequencing with bicriteria,” Journal of Optimization Theory and Applications, vol. 39, pp. 105–124, 1983.
R.T. Nelson, R.K. Sarin, and R.L. Daniels, “Scheduling with multiple performance measures: The one-machine case,” Management Science, vol. 32, pp. 464–479, 1986.
J.B. Pickens and J.G. Hoff, “Fuzzy goal programming in forestry, an application with special solution,” Fuzzy Sets and Systems, vol. 39, no. 3, pp. 239–246, 1991.
C.N. Potts and K.R. Baker, “Flow shop scheduling with lot streaming,” Operations Research Letters, vol. 8, no. 6, pp. 297–303, 1989.
D. Prakash, “Unit processing time bicriteria scheduling on parallel machines,” M.S. Thesis, Virginia Polytechnic Institute and State University, Blacksburg, Virginia, 1998.
R. Ramesh and J.M. Cary, “Multicriteria job shop scheduling,” Computers and Industrial Engineering, vol. 17, pp. 597–602, 1989.
S.C. Sarin and R. Hariharan, “A two machine bicriteria scheduling problem,” International Journal of Production Economics, vol. 65, no, 2, pp. 125–139, 2000.
T. Sen, F.M.E. Raizhel, and P. Dilelepan, “Branch and bound approach to the bicriteria scheduling problem involving total flow time and range of lateness,” Management Science, vol. 23, pp. 1016–1019, 1977.
W.E. Smith, “Various optimizers for single stage production,” Naval Research Logistics Quarterly, vol. 3, no. 1, March 1956.
V. T'kindt and J.-C. Billaut, Multicriteria Scheduling: Theory, Models and Algorithms, Springer-Verlag: Berlin, 2002.
G.L. Vairaktararis and C.-Y. Lee, “The single-machine scheduling problem to minimize total tardiness subject to minimum number of tardy jobs,” IIE Transactions, vol. 27, no. 2, pp. 250–256, 1995.
V.L.N. van Wassenhove and L.F. Gelders, “Solving bicriterion scheduling problem,” European Journal of Operations Research, vol. 4, pp. 42–48, 1980.
R.G. Vickson and B.E. Alfredson, “Two and three machine flow shop scheduling porblems with equal sized transfer batches,” International Journal of Production Research, vol. 30, pp. 1551–1574, 1992.
R.J.Wittrock, “Scheduling algorithms for flexible flow lines,” IBM Journal of Research and Development, vol. 29, pp. 401–412, 1985.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sarin, S.C., Prakash, D. Equal Processing Time Bicriteria Scheduling on Parallel Machines. Journal of Combinatorial Optimization 8, 227–240 (2004). https://doi.org/10.1023/B:JOCO.0000038909.06086.ed
Issue Date:
DOI: https://doi.org/10.1023/B:JOCO.0000038909.06086.ed