Abstract
We study the problem of scheduling n jobs on two identical parallel processors or machines where an optimal schedule is defined as one with the shortest total weighted flowtime (i.e., the sum of the weighted completion time of all jobs), among the set of schedules with minimum makespan (i.e., the completion time of the last job finished). We present a two phase non-linear Integer Programming formulation for its solution, admittedly not to be practical or useful in most cases, but theoretically interesting since it models the problem. Thus, as an alternative, we propose an optimization algorithm, for small problems, and a heuristic, for large problems, to find optimal or near optimal solutions. Furthermore, we perform a computational study to evaluate and compare the effectiveness of the two proposed methods.
Similar content being viewed by others
References
Baker K.R., Merten A.C. (1973) Scheduling with parallel processors & linear delay costs. Naval Research Logistics Quarterly 20: 793–804. doi:10.1002/nav.3800200417
Berrichi, A., Amodeo, L., Yalaoui, F., Chatelet, E., & Mezghiche, M. (2008). Bi-objective optimization algorithms for joint production and maintenance scheduling: Application to the parallel machine problem. Journal of Intelligent Manufacturing. doi:10.1007/s10845-008-0113-5.
Bruno J., Coffman E.G., Sethi R. (1974) Scheduling independent tasks to reduce mean finishing time. Communications of the ACM 17: 382–387. doi:10.1145/361011.361064
Chen C., Bulfin R.L. (1993) Complexity of single machine, multi-criteria scheduling problems. European Journal of Operational Research 70: 115–125. doi:10.1016/0377-2217(93)90236-G
Coffman E.G., Garey M.R., Johnson D.S. (1978) An application of bin-packing to multiprocessor scheduling. SIAM Journal on Computing 7: 1–17. doi:10.1137/0207001
Eck B.T., Pinedo M. (1993) On the minimization of the makespan subject to flowtime optimality. Operations Research 41: 797–800. doi:10.1287/opre.41.4.797
Ganesan P.K., Sivakumar A.I. (2006) Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times. International Journal of Production Economics 103: 633–647. doi:10.1016/j.ijpe.2005.12.004
Garey M.R., Johnson D.S. (1979) Computers & intractability: a guide to the theory of NP-completeness. Freeman, San Francisco
Graham R.L. (1968) Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics 17: 416–429. doi:10.1137/0117039
Gupta J.N.D., Ho J.C. (2000) Minimizing flowtime subject to optimal makespan on two identical parallel machines. Pesquisa Operacional 20: 5–17. doi:10.1590/S0101-74382000000100003
Gupta J.N.D., Ho J.C. (2001) Minimizing makespan subject to minimum flowtime on two identical parallel machines. Computers & Operations Research 28: 705–717. doi:10.1016/S0305-0548(99)00083-0
Gupta J.N.D., Ho J.C., Ruiz-Torres A.J. (2004) Makespan minimization on identical parallel machines subject to minimum total flowtime. Journal of Chinese Institute of Industrial Engineers 21: 220–229
Gupta J.N.D., Ho J.C., Webster S. (2000) Bicriteria optimization of makespan and mean flowtime on two identical parallel machines. The Journal of the Operational Research Society 51: 1330–1339
Gupta J.N.D., Ruiz-Torres A.J. (2000) Minimizing makespan subject to minimum total flow-time on identical parallel machines. European Journal of Operational Research 125: 370–380. doi:10.1016/S0377-2217(99)00386-0
Ho J.C., Wong J.S. (1995) Makespan minimization for parallel identical processors. Naval Research Logistics 42: 935–948. doi:10.1002/1520-6750(199509)42:6<935::AID-NAV3220420606>3.0.CO;2-D
Laub J.D., Fowler J.W., Keha A.B. (2007) Minimizing makespan with multiple-orders-per-job in a two-machine flowshop. European Journal of Operational Research 182: 63–79. doi:10.1016/j.ejor.2006.07.023
Lee C.Y., Massey J.D. (1988) Multiprocessor scheduling: An extension of the multifit algorithm. Journal of Manufacturing Systems 7: 25–32. doi:10.1016/0278-6125(88)90030-1
Lee C.Y., Vairaktarakis G.L. (1993) Complexity of single machine hierarchical scheduling: A survey. In: Pardalos P.M. (eds) Complexity in numerical optimization. World Scientific Publishing Company, New Jersey
Lin B.M.T., Jeng A.A.K. (2004) Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs. International Journal of Production Economics 91: 121–134. doi:10.1016/j.ijpe.2003.07.003
Moore J.M. (1968) An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science 15: 102–109. doi:10.1287/mnsc.15.1.102
Nagar A., Haddock J., Heragu S. (1995) Multiple & bicriteria scheduling: A literature survey. European Journal of Operational Research 81: 88–104. doi:10.1016/0377-2217(93)E0140-S
Pinedo M., Chao X. (1999) Operations scheduling with applications in manufacturing & services. McGraw-Hill, New York
Ruiz-Torres A.J., Ho J.C., Lopez F. (2006) Generating Pareto schedules with outsource and internal parallel resources. International Journal of Production Economics 103: 810–825. doi:10.1016/j.ijpe.2005.11.010
Sarin S.C., Ahn S., Bishop A.B. (1988) An improved branching scheme for the branch & bound procedure of scheduling n jobs on m machines to minimize total weighted flow time. International Journal of Production Research 26: 1183–1191. doi:10.1080/00207548808947934
Smith W.E. (1956) Various optimizers for single-state production. Naval Research Logistics Quarterly 3: 59–66. doi:10.1002/nav.3800030106
Sule D.R. (1997) Industrial scheduling. PWS Publishing, Boston
Tang L., Luo J. (2006) A new ILS algorithm for parallel machine scheduling problems. Journal of Intelligent Manufacturing 17: 609–619. doi:10.1007/s10845-006-0032-2
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ho, J.C., López, F.J., Ruiz-Torres, A.J. et al. Minimizing total weighted flowtime subject to minimum makespan on two identical parallel machines. J Intell Manuf 22, 179–190 (2011). https://doi.org/10.1007/s10845-009-0270-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10845-009-0270-1