Abstract
In this work, we introduce a local search strategy for combinatorial optimization problems which explores neighborhoods obtained using fragments of current solutions. We apply the approach to the well-known \(\mathcal{NP}\) -hard 2-machine bicriteria flowshop scheduling problem. Computational experiments using benchmark data show the approach to be effective when compared to other algorithms available for the problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chen, C.L., Bulfin, R.L.: Complexity results for multi-machine multi-criteria scheduling problems. In: Proceedings of the Third Industrial Engineering Research Conference, pp. 662–665. Institute of Industrials Engineers, Georgia (1994)
Conway, R.W., Maxwell, W.L., Miller, L.W.: Theory of Scheduling. Addison-Wesley, Reading (1967)
Gupta, J.N.D., Hennig, K., Werner, F.: Local search heuristics for two-stage flow shop problems with secondary criterion. Comput. Oper. Res. 29, 123–149 (2002)
Gupta, J.N.D., Neppalli, V.R., Werner, F.: Minimizing total flow time in a two-machine flowshop problem with minimum makespan. International J. Prod. Econ. 69, 323–338 (2001)
Gupta, J.N.D., Palanimuthu, N., Chen, C.L.: Designing a tabu search algorithm for the two-stage flowshop problem with secondary criterion. Prod. Plan. Control 10, 251–265 (1999)
Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Nav. Res. Logist. Q. 1, 61–68 (1954)
Neppalli, V.R., Chen, C.L., Gupta, J.N.D.: Genetic algorithm for the two-stage bicriteria flowshop problem. Eur. J. Oper. Res. 95, 356–373 (1996)
Rajendran, C.: Two-stage flow shop scheduling problem with bicriteria. J. Oper. Res. Soc. 43(9), 871–884 (1992)
T’Kindt, V., Gupta, J.N.D., Billaut, J.-C.: A branch-and-bound algorithm to solve a two-machine bicriteria flowshop scheduling problem. Presented at ORP3 2001 — Operational Research Peripatetic Post-graduate Programme Conference, Paris, 2001
T’Kindt, V., Monmarché, N., Tercinet, F., Laügt, D.: An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem. Eur. J. Oper. Res. 142, 250–257 (2002)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Huang, G., Lim, A. & Rodrigues, B. A local search using solution fragments for the 2-machine bicriteria scheduling problem. Comput Optim Appl 37, 219–229 (2007). https://doi.org/10.1007/s10589-007-9018-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-007-9018-z