The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Investigating the Efficiency of GRASP for the SDST HFS with Controllable Processing Times and Assignable Due Dates
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).
Related Content
|
Pawan Kumar, Mukul Bhatnagar, Sanjay Taneja.
© 2024.
26 pages.
|
|
Kapil Kumar Aggarwal, Atul Sharma, Rumit Kaur, Girish Lakhera.
© 2024.
19 pages.
|
|
Mohammad Kashif, Puneet Kumar, Sachin Ghai, Satish Kumar.
© 2024.
15 pages.
|
|
Manjit Kour.
© 2024.
13 pages.
|
|
Sanjay Taneja, Reepu.
© 2024.
19 pages.
|
|
Jaspreet Kaur, Ercan Ozen.
© 2024.
28 pages.
|
|
Hayet Kaddachi, Naceur Benzina.
© 2024.
25 pages.
|
|
|