Abstract
In this paper, three different lower bound models of the no-wait flow-shop scheduling problem (NFSSP) with sequence dependent setup times (SDSTs) and release dates (RDs) are proposed to minimize the makespan time criterion, which is a typical NP-hard combinatorial optimization problem. First, a mixed integer programming model for flow shop scheduling problems is proposed. Secondly, some variables and constraints are relaxed based on the model proposed in this paper. Thirdly, in order to improve the lower bound of this model, a Lagrangian relaxation (LR) model for the flow shop scheduling problem is designed and an improved subgradient algorithm is proposed to solve this problem. The algorithm simulation experiment shows the effectiveness of the algorithm proposed by the article about flow shop scheduling problem and can calculate a tight lower bound.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Graham, R.L., Lawler, E.L., Lenstra, J.K., et al.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5(1), 287–326 (1979)
Sahni, S., Cho, Y.: Complexity of scheduling shops with no wait in process. Math. Oper. Res. 4(4), 448–457 (1979)
Urlings, T., Ruiz, R., Stützle, T.: Shifting representation search for hybrid flexible flowline problems. Eur. J. Oper. Res. 207(2), 1086–1095 (2010)
Oguz, C., Salman, F.S., Yalçin, Z.B.: Order acceptance and scheduling decisions in make-to-order systems. Int. J. Prod. Econ. 125(1), 200–211 (2010)
Wismer, D.A.: Solution of the flowshop-scheduling problem with no intermediate queues. Oper. Res. 20(3), 689–697 (1972)
Qian, B., Wang, L., Hu, R., et al.: A hybrid differential evolution method for permutation flow-shop scheduling. Int. J. Adv. Manuf. Technol. 38(7–8), 757–777 (2008)
Szwarc, W., Gupta, J.N.D.: A flow-shop problem with sequence-dependent additive setup times. Naval Res. Logist. 34(5), 619–627 (2015)
Tang, L., Luh, P.B., Liu, J., et al.: Steel-making process scheduling using Lagrangian relaxation. Int. J. Prod. Res. 40(1), 55–70 (2002)
Luh, P.B., Hoitomt, D.J.: Scheduling of manufacturing systems using the lagrangian relaxation technique. IEEE Trans. Autom. Control 38(6), 1066–1079 (1993)
Held, M., Wolfe, P., Crowder, H.P.: Validation of subgradient optimization. Math. Program. 6(1), 62–88 (1974)
Bianco, L., Ricciardelli, S., Rinaldi, G., et al.: Scheduling tasks with sequence-dependent processing times. Naval Res. Logist. 35(2), 177–184 (1988)
Chvátal, V., Cook, W., Dantzig, G.B., et al.: Solution of a large-scale traveling-salesman problem. J. Oper. Res. Soc. Am. 2(4), 393–410 (1954)
Miller, C.: Integer programming formulations and traveling salesman problems. J. ACM 7, 326–329 (1960)
Acknowledgements.
This research is partially supported by the National Science Foundation of China (51665025), National Natural Science Fund for Distinguished Young Scholars of China (61525304), and the Applied Basic Research Foundation of Yunnan Province (2015FB136).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Yu, NK., Hu, R., Qian, B., Zhang, ZQ., Wang, L. (2018). Improved Sub-gradient Algorithm for Solving the Lower Bound of No-Wait Flow-Shop Scheduling with Sequence-Dependent Setup Times and Release Dates. In: Huang, DS., Gromiha, M., Han, K., Hussain, A. (eds) Intelligent Computing Methodologies. ICIC 2018. Lecture Notes in Computer Science(), vol 10956. Springer, Cham. https://doi.org/10.1007/978-3-319-95957-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-95957-3_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-95956-6
Online ISBN: 978-3-319-95957-3
eBook Packages: Computer ScienceComputer Science (R0)