Identical parallel machine scheduling to minimise makespan and total weighted completion time: A column generation approach

International Journal of Production Research

Volumn 51, Issue 23-24, 2013, Pages 7091-7104

  Xu, Jingyang ^a   Nagi, Rakesh ^a  

^a the State University of New York   (United States)

Author keywords

Branch andprice; Column generation; Identical parallel machine scheduling; Makespan; Weighted completion time

Indexed keywords

BRANCH-ANDPRICE; COLUMN GENERATION; IDENTICAL PARALLEL MACHINES; MAKESPAN; WEIGHTED COMPLETION TIME;

BUSINESS MACHINES; EXPERIMENTS; OPTIMIZATION; SCHEDULING ALGORITHMS;

PROBLEM SOLVING;

EID: 84890556345     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2013.825379     Document Type: Article

References (30)

1. Ahuja, R. K., T. L. Magnanti, and J. B. Orlin. 1993. Network Flows: Theory, Algorithm, and Application. Englewood Cliffs, NJ: Prentice Hall.
2. Akker, J.V. D., J.A.Hoogeveen, and S. L. van deVelde. 1999. "ParallelMachine Scheduling by Column Generation." Operations Research 47 (6): 862-872.
3. Azizoglu, M., and O. Kirca. 1999. "On the Minimization of Total Weighted Flow Time with Identical and Uniform Parallel Machines." European Journal of Operational Research 113 (1): 91-100.
4. Barnhart, C., E. L. Johnson, G. Nemhauser, and M. Savelsbergh. 1998. "Branch-and-price: Column Generation for Solving Huge Integer Programs." Operations Research 46 (3): 316-329. (Pubitemid 128655433)
5. Bazaraa, M. S., J. J. Javis, and H. D. Sherali. 2004. Linear Programming and Network Flows. 3rd ed. Hoboken, NJ:Wiley-Interscience.
6. Belouadah, H., and C. Potts. 1994. "Scheduling Identical Parallel Machines to Minimize Total Weighted Completion Time." Discrete Applied Mathematics 48 (3): 201-218.
7. Chekuri, C., R. Motwani, B. Natarajan, and C. Stein. 1997. "Approximation Techniques for Average Completion Time Scheduling." In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 609-618. Philadelphia, PA.
8. Chen, H., and P. B. Luh. 1999. "An Alternate Framework to Lagrangian Relaxation Approach for Job Shop Scheduling." Journal of Optimization Theory and Transactions 100 (3): 699-712.
9. Chen, Z., and W. Powell. 1999. "A Column Generation Based Decomposition Algorithm for a Parallel Machine Just-in-time Scheduling Problem." European Journal of Operational Research 116 (1): 220-232.
10. Dell'Amico, M., and S. Martello. 1995. "Optimal Scheduling of Tasks on Identical Parallel Processors." ORSA Journal on Computing 7 (2): 191-200.
11. Dell'Amico, M., and S. Martello. 2005. "A Note on Exact Algorithms for the Identical Parallel Machine Scheduling Problem." European Journal of Operational Research 160 (2): 576-578.
12. Dell'Amico, M., S. Martello, and D. Vigo. 1995. "Minimizing the Sum of Weighted Completion Times with Unrestricted Weights." Discrete Applied Mathematics 63 (1): 25-41.
13. Epstein, L., and J. Sgall. 2004. "Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines." Algorithmica 39 (1): 43-57. (Pubitemid 40871672)
14. Eren, T., and E. Guner. 2009. "A Bicriteria Parallel Machine Scheduling with a Learning Effect." International Journal of Advanced Manufacturing Technology 40 (11-12): 1202-1205.
15. Frangioni, A., E. Necciari, and M. Scutella. 2004. "AMulti-exchange Neighborhood forMinimum Makespan ParallelMachine Scheduling Problems." Journal of Combinatorial Optimization 8 (2): 195-220.
16. Graham, R. L. 1966. "Bounds for Certain Multiprocessing Anomalies." Bell System Technical Journal 45 (9): 1563-1581.
17. Haouari, M., A. Gharbi, and M. Jemmali. 2006. "Tight Bounds for the Identical Parallel Machine Scheduling Problem." International Transactions in Operational Research 33 (6): 529-548.
18. Haouari, M., and M. Jemmali. 2008. "Tight Bounds for the Identical Parallel Machine Scheduling Problem: Part II." International Transactions in Operations Research 15 (1): 19-34.
19. Kawaguchi, T., and S. Kyan. 1986. "Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-time Problem." SIAM Journal on Computing 15 (4): 1119-1129. (Pubitemid 17465859)
20. Lee, C., and R. Uzsoy. 1992. "A New Dynamic Programming Algorithm for the Parallel Machines Total Weighted Completion Time Problem." Operations research letters 92 (2): 73-75.
21. Leonardi, S., and D. Raz. 2007. "Approximation Total Flow Time on Parallel Machines." Journal of Computer and System Sciences 73 (6): 875-891. (Pubitemid 46907088)
22. Liu, M., and C. Wu. 1999. "A Genetic Algorithm for Minimizing the Makespan in the Case of Scheduling Identical Parallel Machines." Artificial Intelligence in Engineering 13 (4): 399-403.
23. Mokotoff, E. 2004. "An Exact Algorithm for the Identical Parallel Machine Scheduling Problem." European Journal of Operational Research 152 (3): 758-769.
24. Schulz, A. 1996. "Scheduling to Minimize TotalWeighted Completion Time: Performance Guarantees of LP-based Heuristics and Lower Bounds." Integer Programming and Combinatorial Optimization 1084 : 301-315. (Pubitemid 126078627)
25. Skutella, M., and G. Woeginger. 2000. "A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines." Mathematics of Operations Research 25 (1): 63-75.
26. Smith, W. E. 1956. "Various Optimizer for Single-stage Production." Naval Research Logistics Quarterly 3 (1-2): 59-66.
27. Stein, C., and J. Wein. 1997. "On the Existence of Schedules that are Near Optimal for Both Makespan and Total Weighted Completion Time." Operations Research Letters 21 (3): 115-122. (Pubitemid 127420347)
28. Tang, L., H. Xuan, and J. Liu. 2006. "A New Lagrangian Relaxation Algorithm for Hybrid Flowshop Scheduling to Minimize Total Weighted Completion Time." Computers and Operations Research 33 (11): 3344-3359. (Pubitemid 43333229)
29. Webster, S. 1992. "New Bounds for the Identical Parallel ProcessorWeighted Flow Time Problem." Management Science 38 (1): 124-136.
30. Xu, J., and R. Nagi. (2013). "Solving Assembly Scheduling Problems with Tree-Structure Precedence Constraints: A Lagrangian Relaxation Approach. " IEEE Transaction on Automation Science and Engineering 10 (3): 757-771.