A Global Constraint for Total Weighted Completion Time
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, an O(n 4) algorithm is proposed, which makes use of the preemptive mean busy time relaxation of the scheduling problem. The solution to this problem is used to test if an activity can start at each start time in its domain in solutions that respect the upper bound on the cost of the schedule. Empirical results show that the proposed global constraint significantly improves the performance of constraint-based approaches to single-machine scheduling for minimizing the total weighted completion time. Since our eventual goal is to use the global constraint as part of a larger optimization problem, we view this performance as very promising. We also sketch the application of the global constraint to cumulative resources and to problems with multiple machines.
KeywordsSchedule Problem Completion Time Single Machine Global Constraint Total Weighted Tardiness
Unable to display preview. Download preview PDF.
- 1.Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., Sviridenko, M.: Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. In: Proc. of the 40th IEEE Symposium on Foundations of Computer Science, pp. 32–44 (1999)Google Scholar
- 7.Chen, B., Potts, C.N., Woeginger, G.J.: A Review of Machine Scheduling: Complexity, Algorithms and Approximation. In: Handbook of Combinatorial Optimization, vol. 3, pp. 21–169. Kluwer Academic Publishers, Dordrecht (1998)Google Scholar
- 13.Jouglet, A., Baptiste, P., Carlier, J.: Branch-and-Bound Algorithms for Total Weighted Tardiness. In: Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Chapman & Hall / CRC, Boca Raton (2004)Google Scholar
- 14.Kéri, A., Kis, T.: Primal-dual Combined with Constraint Propagation for Solving RCPSPWET. In: Proc. of the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications, pp. 748–751 (2005)Google Scholar
- 15.Nessah, R., Yalaoui, F., Chu, C.: A Branch-and-bound Algorithm to Minimize Total Weighted Completion Time on Identical Parallel Machines with Job Release Dates. Computers and Operations Research (in print)Google Scholar
- 16.Pan, Y.: Test Instances for the Dynamic Single-machine Sequencing Problem to Minimize Total Weighted Completion Time, Available at http://www.cs.wisc.edu/~yunpeng/test/sm/dwct/instances.htm
- 17.Pan, Y., Shi, L.: New Hybrid Optimization Algorithms for Machine Scheduling Problems. IEEE Transactions on Automation Science and Engineering (in print)Google Scholar
- 18.Schulz, A.S.: Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol. 1084, pp. 301–315. Springer, Heidelberg (1996)Google Scholar