A global constraint for total weighted completion time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4510 LNCS, Issue , 2007, Pages 112-126

  Kovács, Andrés ^a,c   Beck, J Christopher ^b  

^a INRIA ROCQUENCOURT   (France)

^b UNIVERSITY OF TORONTO   (Canada)

^c INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; GLOBAL OPTIMIZATION; LINEAR PROGRAMMING; PROBLEM SOLVING; SCHEDULING;

CUMULATIVE RESOURCES; SINGLE MACHINE SCHEDULING; TOTAL WEIGHTED COMPLETION TIME;

RESOURCE ALLOCATION;

EID: 37149008488     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72397-4_9     Document Type: Conference Paper

References (18)

1. F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, M. Sviridenko. 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.
2. C. Akkan, S. Karabati. The Two-machine Flowshop Total Completion Time Problem: Improved Lower Bounds and a Branch-and-bound Algorithm. European Journal of Operational Research 159:420-429, 2004.
3. J.M. van den Akker, C.A.J. Hurkens, M.W.P. Savelsbergh. Time-indexed Formulations for Machine Scheduling Problems: Column Generation. INFORMS Journal on Computing 12:111-124, 2000.
4. Ph. Baptiste, J. Cartier, A. Jouglet. A Branch-and-Bound Procedure to Minimize Total Tardiness on One Machine with Arbitrary Release Dates. European Journal of Operational Research 158:595-608, 2004.
5. Ph. Baptiste, L. Peridy, E. Pinson. A Branch and Bound to Mininimze the Number of Late Jobs on a Single Machine with Release Time Constraints. European Journal of Operational Research 144(1):1-11, 2003.
6. H. Belouadah, M.E. Posner, C.N. Potts. Scheduling with Release Dates on a Single Machine to Minimize Total Weighted Completion Time. Discrete Applied Mathematics 36:213-231, 1992.
7. B. Chen, C.N. Potts, G.J. Woeginger. A Review of Machine Scheduling: Complexity, Algorithms and Approximation. In: Handbook of Combinatorial Optimization, Vol. 3, pp. 21-169, Kluwer, 1998.
8. F. Della Croce, M. Ghirardi, R. Tadei. An Improved Branch-and-bound Algorithm for the Two Machine Total Completion Time Flow Shop Problem. European Journal of Operational Research 139:293-301, 2002.
9. M. Dyer, L.A. Wolsey. Formulating the Single Machine Sequencing Problem with Release Dates as Mixed Integer Program. Discrete Applied Mathematics 26:255-270, 1990.
10. F. Focacci, A. Lodi, M. Milano. Embedding Relaxations in Global Constraints for Solving TSP and TSPTW. Annals of Mathematics and Artificial Intelligence 34(4):291-311, 2002.
11. F. Focacci, A. Lodi, M. Milano. Optimization-Oriented Global Constraints. Constraints 7(3-4):351-365, 2002.
12. M.X. Goemans, M. Queyranne, A.S. Schulz, M. Skutella, Y. Wang. Single Machine Scheduling with Release Dates. SIAM Journal on Discrete Mathematics 15(2):165-192, 2002.
13. A. Jouglet, Ph. Baptiste, J. Carlier. Branch-and-Bound Algorithms for Total Weighted Tardiness. In: Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Chapter 13, Chapman & Hall / CRC, 2004.
14. A. Kéri, T. Kis. 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.
15. R. Nessah, F. Yalaoui, C. Chu. 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.
16. Y. Pan. Test Instances for the Dynamic Single-machine Sequencing Problem to Minimize Total Weighted Completion Time. Available at http ://www.cs.wise.edu/~yunpeng/test/sm/dwct/instances.htm
17. Y. Pan, L. Shi. New Hybrid Optimization Algorithms for Machine Scheduling Problems. IEEE Transactions on Automation Science and Engineering, in print.
18. A.S. Schulz. Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds. Proc. of the 5th Int. Conf. on Integer Programming and Combinatorial Optimization, pp. 301-315, 1996.