Welcome to the InfoSci Platform
Reference Hub1
A Variable Neighborhood Search Algorithm to Solve the Flow Shop-Scheduling Problem Through Blocking: Variable Neighborhood Search (VNS)

A Variable Neighborhood Search Algorithm to Solve the Flow Shop-Scheduling Problem Through Blocking: Variable Neighborhood Search (VNS)

Dalel Bouzidi
Copyright: © 2020 |Pages: 11
ISBN13: 9781799802686|ISBN10: 179980268X|ISBN13 Softcover: 9781799802693|EISBN13: 9781799802709
DOI: 10.4018/978-1-7998-0268-6.ch004
Cite Chapter Cite Chapter

MLA

Bouzidi, Dalel. "A Variable Neighborhood Search Algorithm to Solve the Flow Shop-Scheduling Problem Through Blocking: Variable Neighborhood Search (VNS)." Transportation, Logistics, and Supply Chain Management in Home Healthcare: Emerging Research and Opportunities, edited by Jalel Euchi, IGI Global, 2020, pp. 63-73. https://doi.org/10.4018/978-1-7998-0268-6.ch004

APA

Bouzidi, D. (2020). A Variable Neighborhood Search Algorithm to Solve the Flow Shop-Scheduling Problem Through Blocking: Variable Neighborhood Search (VNS). In J. Euchi (Ed.), Transportation, Logistics, and Supply Chain Management in Home Healthcare: Emerging Research and Opportunities (pp. 63-73). IGI Global. https://doi.org/10.4018/978-1-7998-0268-6.ch004

Chicago

Bouzidi, Dalel. "A Variable Neighborhood Search Algorithm to Solve the Flow Shop-Scheduling Problem Through Blocking: Variable Neighborhood Search (VNS)." In Transportation, Logistics, and Supply Chain Management in Home Healthcare: Emerging Research and Opportunities, edited by Jalel Euchi, 63-73. Hershey, PA: IGI Global, 2020. https://doi.org/10.4018/978-1-7998-0268-6.ch004

Export Reference

Mendeley
Favorite

Abstract

In this chapter, we deal with the flow shop-scheduling problem through blocking known to be difficult, where there is no space and a task remains blocked on a machine until the next machine is available. For this reason, we propose the heuristic approach to minimize the delay (tardiness) as an optimization criterion. This chapter proposes a VNS-based heuristic the solutions of which are compared to those of the metaheuristic Greedy Randomized Adaptive Search Procedure (GRASP). We have developed a heuristic-based VNS to get better solutions in a reasonable time. Finally, comparisons with optimal solutions for small problems have shown that all versions can give good results; it would be interesting to extend the ideas presented in this document to the blocking flow shop at minimizing the total delay.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.