Investigating the Efficiency of GRASP for the SDST HFS with Controllable Processing Times and Assignable Due Dates

Investigating the Efficiency of GRASP for the SDST HFS with Controllable Processing Times and Assignable Due Dates

Maryam Ashrafi, Hamid Davoudpour, Mohammad Abbassi
ISBN13: 9781466644502|ISBN10: 1466644508|EISBN13: 9781466644519
DOI: 10.4018/978-1-4666-4450-2.ch018
Cite Chapter Cite Chapter

MLA

Ashrafi, Maryam, et al. "Investigating the Efficiency of GRASP for the SDST HFS with Controllable Processing Times and Assignable Due Dates." Handbook of Research on Novel Soft Computing Intelligent Algorithms: Theory and Practical Applications, edited by Pandian M. Vasant, IGI Global, 2014, pp. 538-567. https://doi.org/10.4018/978-1-4666-4450-2.ch018

APA

Ashrafi, M., Davoudpour, H., & Abbassi, M. (2014). Investigating the Efficiency of GRASP for the SDST HFS with Controllable Processing Times and Assignable Due Dates. In P. Vasant (Ed.), Handbook of Research on Novel Soft Computing Intelligent Algorithms: Theory and Practical Applications (pp. 538-567). IGI Global. https://doi.org/10.4018/978-1-4666-4450-2.ch018

Chicago

Ashrafi, Maryam, Hamid Davoudpour, and Mohammad Abbassi. "Investigating the Efficiency of GRASP for the SDST HFS with Controllable Processing Times and Assignable Due Dates." In Handbook of Research on Novel Soft Computing Intelligent Algorithms: Theory and Practical Applications, edited by Pandian M. Vasant, 538-567. Hershey, PA: IGI Global, 2014. https://doi.org/10.4018/978-1-4666-4450-2.ch018

Export Reference

Mendeley
Favorite

Abstract

This chapter deals with a hybrid flow shop scheduling problem involving sequence dependent setup times, commonly known as the SDST hybrid flow shop, and each stage (work centre) consists of parallel identical machines. In this problem, each job has a different release date and consists of ordered operations that must be processed on machines from different centers in the same order. In addition, the processing times of operations on some machine centers may vary between a minimum and a maximum value depending on the use of a continuously divisible resource. We consider a non-regular optimization criterion based on due dates which are not a priori given or fixed but can be assigned by a decision-maker. A due date assignment cost is also included into the objective function. Finally, the results obtained through the use of GRASP (Greedy Randomized Adaptive Search Procedure) are compared with those computed by SA (Simulated Annealing).

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.