Solving assembly scheduling problems with tree-structure precedence constraints: A Lagrangian relaxation approach

IEEE Transactions on Automation Science and Engineering

Volumn 10, Issue 3, 2013, Pages 757-771

  Xu, Jingyang ^a   Nagi, Rakesh ^a  

^a UNIVERSITY AT BUFFALO   (United States)

Author keywords

Assembly scheduling; Lagrangian relaxation (LR); Makespan; Parallel machine scheduling; Randomized algorithm; Subgradient search

Indexed keywords

ASSEMBLY SCHEDULING; LAGRANGIAN RELAXATIONS; MAKESPAN; PARALLEL MACHINE SCHEDULING; RANDOMIZED ALGORITHMS; SUBGRADIENT;

FORESTRY; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; SCHEDULING ALGORITHMS;

PROBLEM SOLVING;

ALGORITHMS; COMPUTER PROGRAMING; FORESTRY; PROBLEM SOLVING; RELAXATION; SCHEDULING;

EID: 84892576600     PISSN: 15455955     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASE.2013.2259816     Document Type: Article

References (31)

1. A. Agrawal, G. Harhalakis, I.Minis, and R. Nagi, "'Just-in-time' production of large assemblies," IIE Trans., vol. 28, no. 8, pp. 653-667, 1996.
2. J. Carlier and E. Pinson, "An algorithm for solving the job-shop problem," Manage. Sci., vol. 35, no. 2, pp. 164-176, 1989.
3. P. Brucker, B. Jurisch, and B. Sievers, "A branch and bound algorithm for the job-shop scheduling problem," Discrete Appl. Math., vol. 49, no. 1-3, pp. 107-127, 1994.
4. J. Adams, E. Balas, and D. Zawack, "The shifting bottleneck procedure for job shop scheduling," Manage. Sci., vol. 34, no. 3, pp. 391-401, 1988.
5. C. Y. Zhang, P. Li,Y.Rao, and Z. Guan, "Avery fast TS/SAalgorithm for the job shop scheduling problem," Comput. Oper. Res., vol. 35, no. 1, pp. 282-294, 2008.
6. S. M. K. Hasan, R. Sarker, and D. Essam, "Memetic algorithms for solving job-shop scheduling problems," Memetic Comput., vol. 1, no. 1, pp. 69-83, 2008.
7. G. Zhang, L. Gao, and Y. Shi, "An effective genetic algorithm for the flexible job-shop scheduling problem," Expert Syst.With Appl., vol. 38, no. 4, pp. 3563-3573, 2011.
8. M. Yin, X. Li, and J. Zhou, "An efficient job shop scheduling algorithm based on artificial bee colony," Sci. Res. Essays, vol. 5, no. 24, pp. 2578-2596, 2011.
9. M. Yazdani,M. Amiri, and M. Zandieh, "Flexible job-shop scheduling with parallel variable neighborhood search algorithm," Expert Syst. With Appl., vol. 37, no. 1, pp. 678-687, 2010.
10. T. Lin, S. Horng, T. Kao, Y. Chen, R. Run, R. Chen, J. Lai, and I. Kuo, "An efficient job-shop scheduling algorithm based on particle swarm optimization," Expert Syst. With Appl., vol. 37, no. 3, pp. 2629-2636, 2010.
11. I. M. Ovacik and R. Uzsoy, Decomposition Methods for Complex Factory Scheduling Problems, 1st ed. New York, NY, USA: Springer, 1996.
12. K.-P. Chen, M. S. Lee, P. S. Pulat, and S. A. Moses, "The shifting bottleneck procedure for job-shops with parallel machines," Int. J. Ind. Syst. Eng., vol. 1, no. 1/2, pp. 244-262, 2006.
13. H. Hu and Z. Li, "Modeling and scheduling for manufacturing grid workflows using timed petri nets," Int. J. Adv. Manuf. Technol., vol. 42, no. 5-6, pp. 553-568, 2009.
14. H. Hu and Z. Li, "Synthesis of liveness enforcing supervisor for automated manufacturing systems using insufficiently marked siphons," J. Int. Manuf., vol. 21, no. 4, pp. 555-567, 2010.
15. M. L. Pinedo, Scheduling: Theory, Algorithms, and Systems, 3rd ed. New York, NY, USA: Springer, 2008.
16. Y. Mati, S. Dauzere-Peres, and C. Lahlou, "A general approach for optimizing regular criteria in the job-shop scheduling problem," Eur. J. Oper. Res., vol. 212, no. 1, pp. 33-42, 2011.
17. M. L. Fisher, "Optimal solution of scheduling problems using Lagrange multipliers, Part (i)," Oper. Res., vol. 21, no. 5, pp. 646-653, 1973.
18. D. J. Hoitomt, P. B. Luh, and K. R. Pattipati, "Scheduling jobs with simple precedence constraints on parallel machines," IEEE Control Syst. Mag., vol. 10, no. 2, pp. 34-40, Feb. 1990.
19. D. J. Hoitomt, P. B. Luh, and K. R. Pattipati, "A practical approach to job shop scheduling problems," IEEE Trans. Robot. Autom., vol. 9, no. 1, pp. 1-13, Feb. 1993.
20. C. S. Czerwinski and P. B. Luh, "Scheduling products with bills of materials using an improved Lagrangian relaxation technique," IEEE Trans. Robot. Autom., vol. 10, no. 2, pp. 99-111, Apr. 1994.
21. C. A. Kaskavelis andM. C. Caramani, "Efficient Lagrangian relaxation algorithms for industry size job-shop scheduling problems," IIE Trans., vol. 30, no. 11, pp. 1085-1097, 1998.
22. T. Nishi, Y. Hiranaka, and M. Inuiguchi, "Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness," Comput. Oper. Res., vol. 37, no. 1, pp. 189-198, 2010.
23. X. Zhao, P. B. Luh, and J. Wang, "Surrogate gradient algorithm for Lagrangian relaxation," J. Optim. Theory Appl., vol. 100, no. 3, pp. 699-712, 1999.
24. H. Chen and P. B. Luh, "An alternative framework to Lagrangian relaxation approach for job shop scheduling," Eur. J. Oper. Res., vol. 149, no. 3, pp. 499-512, 2003.
25. P. Baptiste, M. Flamini, and F. Sourd, "Lagrangian bounds for justintime job-shop scheduling," Comput. Oper. Res., vol. 35, no. 3, pp. 906-915, 2008.
26. T. S. Chang, "Comments on surrogate gradient algorithm for Lagrangian relaxation," J. Optim. Theory Appl., vol. 137, no. 3, pp. 691-697, 2008.
27. J. K. Lenstra and P. Brucker, "Complexity of machine scheduling problems," Ann. Discrete Math., vol. 1, no. 1, pp. 343-362, 1977.
28. H. Belouadah, M. E. Posner, and C. N. Potts, "Scheduling with release dates on a singlemachine to minimize total weighted completion time," Discrete Appl. Math., vol. 36, no. 3, pp. 213-231, 1992.
29. L. Tang, H. Xuan, and J. Liu, "A new Lagrangian relxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time," Comput. Oper. Res., vol. 33, no. 11, pp. 3344-3359, 2006.
30. R. L. Rardin, Optimization in Operations Research, 1st ed. Englewood Cliffs, NJ, USA: Prentice-Hall, 1998.
31. J. Carlier, "Scheduling jobs with release dates and tails on identical machines to minimize the makespan," Eur. J. Oper. Res., vol. 29, no. 3, pp. 298-306, 1987.