Hybrid metaheuristics for solving a fuzzy single batch-processing machine scheduling problem.
This paper deals with a problem of minimizing total weighted tardiness of jobs in a real-world single batch-processing machine (SBPM) scheduling in the presence of fuzzy due date. In this paper, first a fuzzy mixed integer linear programming model is developed. Then, due to the complexity of the pro...
| Publicado en: | Scientific World Journal pp. 214615 - 214616 |
|---|---|
| Autores principales: | , , |
| Formato: | Journal Article |
| Publicado: |
Wiley-Blackwell
2014
|
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=103826027&site=ehost-live header: @attributes: shortDbName: ccm uiTerm: 103826027 longDbName: CINAHL Complete uiTag: AN controlInfo: bkinfo: dissinfo: jinfo: jid: 1537744X 1BX5 jtl: Scientific World Journal issn: 1537744X maglogo: N pubinfo: dt: 2014 pid: 480 pub: Wiley-Blackwell place: Malden, Massachusetts artinfo: ui: 103826027 NLM24883359 2012601863 10.1155/2014/214615 NLM24883359 PMC4030488 103826027 ppf: 214615 ppct: 1 formats: tig: atl: Hybrid metaheuristics for solving a fuzzy single batch-processing machine scheduling problem. aug: au: Molla-Alizadeh-Zavardehi, S Tavakkoli-Moghaddam, R Lotfi, F Hosseinzadeh affil: Department of Industrial Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran. sug: subj: Logic Personnel Staffing and Scheduling Systems Analysis Algorithms Artificial Intelligence Models, Theoretical ab: This paper deals with a problem of minimizing total weighted tardiness of jobs in a real-world single batch-processing machine (SBPM) scheduling in the presence of fuzzy due date. In this paper, first a fuzzy mixed integer linear programming model is developed. Then, due to the complexity of the problem, which is NP-hard, we design two hybrid metaheuristics called GA-VNS and VNS-SA applying the advantages of genetic algorithm (GA), variable neighborhood search (VNS), and simulated annealing (SA) frameworks. Besides, we propose three fuzzy earliest due date heuristics to solve the given problem. Through computational experiments with several random test problems, a robust calibration is applied on the parameters. Finally, computational results on different-scale test problems are presented to compare the proposed algorithms. pubtype: Academic Journal doctype: Journal Article ougenre: Article language: English refInfo: holdings: @attributes: islocal: N |
|---|