0-1 Quadratic programming approach for optimum solutions of two scheduling problems

Two scheduling problems are considered: (1) scheduling n jobs non-preemptively on a single machine to minimize total weighted earliness and tardiness (WET); (2) scheduling n jobs non-preemptively on two parallel identical processors to minimize weighted mean flow time. In the second problem, a pre-ordering of the jobs is assumed that must be satisfied for any set of jobs scheduled on each specific machine. Both problems are known to be NP-complete. A 0-1 quadratic assignment formulation of the problems is presented. An equivalent 0-1 mixed integer linear programming approach for the problems are considered and a numerical example is given. The formulations presented enable one to use optimal and heuristic available algorithms of 0-1 quadratic assignment for the problems considered here.

[1]  Gary A. Kochenberger,et al.  Operations research for managerial decisions , 1972 .

[2]  H. Donald Ratliff,et al.  A Graph-Theoretic Equivalence for Integer Programs , 1973, Oper. Res..

[3]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[4]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[5]  Hamilton Emmons,et al.  Order‐preserving allocation of jobs to two machines , 1974 .

[6]  A note on allocating jobs to two machines , 1975 .

[7]  Sartaj Sahni,et al.  Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[8]  A. K. Mittal,et al.  Unconstrained quadratic bivalent programming problem , 1984 .

[9]  T. C. Edwin Cheng,et al.  An algorithm for the con due-date determination and sequencing problem , 1987, Comput. Oper. Res..

[10]  P. Pardalos,et al.  A global optimization approach for solving the maximum clique problem , 1990 .

[11]  M. A. Quaddus.  A network flow approach to optimal slack due-date determination , 1990 .

[12]  P. Pardalos,et al.  Parallel branch and bound algorithms for quadratic zero–one programs on the hypercube architecture , 1990 .

[13]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[14]  Chung-Yee Lee,et al.  Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date , 1991, Comput. Oper. Res..

[15]  Panos M. Pardalos,et al.  An algorithm for finding a maximum weighted independent set in an arbitrary graph , 1991, Int. J. Comput. Math..

[16]  Marc E. Posner,et al.  Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date , 1991, Oper. Res..

[17]  B. Alidaee.  Maximizing set function formulation of two scheduling problems , 1992, ZOR Methods Model. Oper. Res..