schliessen

Filtern

 

Bibliotheken

Effective heuristic for makespan minimization in parallel batch machines with non-identical capacities

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ijpe.2015.07.021 Byline: Zhao-hong Jia, Kai Li, Joseph Y.-T. Leung Abstract: We consider the problem of scheduling a set of n jobs with arbitrary job sizes on a set of m parallel batch machines with non-identi... Full description

Journal Title: International Journal of Production Economics 2015, Vol.169, p.1(10)
Main Author: Jia, Zhao-Hong
Other Authors: Li, Kai , Leung, Joseph Y.-T.
Format: Electronic Article Electronic Article
Language: English
Subjects:
Quelle: Cengage Learning, Inc.
ID: ISSN: 0925-5273
Zum Text:
SendSend as email Add to Book BagAdd to Book Bag
Staff View
recordid: gale_ofa434848138
title: Effective heuristic for makespan minimization in parallel batch machines with non-identical capacities
format: Article
creator:
  • Jia, Zhao-Hong
  • Li, Kai
  • Leung, Joseph Y.-T.
subjects:
  • Computer Science
  • Algorithms
ispartof: International Journal of Production Economics, 2015, Vol.169, p.1(10)
description: To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ijpe.2015.07.021 Byline: Zhao-hong Jia, Kai Li, Joseph Y.-T. Leung Abstract: We consider the problem of scheduling a set of n jobs with arbitrary job sizes on a set of m parallel batch machines with non-identical capacities; the objective is to minimize the makespan. The problem is known to be NP-hard. A heuristic based on the First-Fit-Decreasing (FFD) rule is presented as well as a meta-heuristic based on Max-Min Ant System (MMAS). The performances of the two heuristics are compared with a previously studied heuristic by computational experiments. The results show that both proposed algorithms outperform the previously studied heuristic. Moreover, the MMAS heuristic obtains better solutions compared with the FFD heuristic. Author Affiliation: (a) Key Lab of Intelligent Computing and Signal Processing of Ministry of Education, Anhui University, Hefei, Anhui 230039, PR China (b) School of Management, Hefei University of Technology, Hefei, Anhui 230009, PR China (c) Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, USA Article History: Received 9 June 2014; Accepted 16 July 2015
language: eng
source: Cengage Learning, Inc.
identifier: ISSN: 0925-5273
fulltext: no_fulltext
issn:
  • 0925-5273
  • 09255273
url: Link


@attributes
ID589499759
RANK0.07
NO1
SEARCH_ENGINEprimo_central_multiple_fe
SEARCH_ENGINE_TYPEPrimo Central Search Engine
LOCALfalse
PrimoNMBib
record
control
sourcerecordid434848138
sourceidgale_ofa
recordidTN_gale_ofa434848138
sourceformatXML
sourcesystemPC
galeid434848138
display
typearticle
titleEffective heuristic for makespan minimization in parallel batch machines with non-identical capacities
creatorJia, Zhao-Hong ; Li, Kai ; Leung, Joseph Y.-T.
ispartofInternational Journal of Production Economics, 2015, Vol.169, p.1(10)
identifierISSN: 0925-5273
subjectComputer Science ; Algorithms
descriptionTo link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ijpe.2015.07.021 Byline: Zhao-hong Jia, Kai Li, Joseph Y.-T. Leung Abstract: We consider the problem of scheduling a set of n jobs with arbitrary job sizes on a set of m parallel batch machines with non-identical capacities; the objective is to minimize the makespan. The problem is known to be NP-hard. A heuristic based on the First-Fit-Decreasing (FFD) rule is presented as well as a meta-heuristic based on Max-Min Ant System (MMAS). The performances of the two heuristics are compared with a previously studied heuristic by computational experiments. The results show that both proposed algorithms outperform the previously studied heuristic. Moreover, the MMAS heuristic obtains better solutions compared with the FFD heuristic. Author Affiliation: (a) Key Lab of Intelligent Computing and Signal Processing of Ministry of Education, Anhui University, Hefei, Anhui 230039, PR China (b) School of Management, Hefei University of Technology, Hefei, Anhui 230009, PR China (c) Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, USA Article History: Received 9 June 2014; Accepted 16 July 2015
languageeng
sourceCengage Learning, Inc.
lds50peer_reviewed
links
openurl$$Topenurl_article
openurlfulltext$$Topenurlfull_article
search
scope
0gale_onefilea
1OneFile
creatorcontrib
0Jia, Zhao-Hong
1Zhao-hong Jia
2Li, Kai
3Leung, Joseph Y.-T
titleEffective heuristic for makespan minimization in parallel batch machines with non-identical capacities.
descriptionTo link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ijpe.2015.07.021 Byline: Zhao-hong Jia, Kai Li, Joseph Y.-T. Leung Abstract: We consider the problem of scheduling a set of n jobs with arbitrary job sizes on a set of m parallel batch machines with non-identical capacities; the objective is to minimize the makespan. The problem is known to be NP-hard. A heuristic based on the First-Fit-Decreasing (FFD) rule is presented as well as a meta-heuristic based on Max-Min Ant System (MMAS). The performances of the two heuristics are compared with a previously studied heuristic by computational experiments. The results show that both proposed algorithms outperform the previously studied heuristic. Moreover, the MMAS heuristic obtains better solutions compared with the FFD heuristic. Author Affiliation: (a) Key Lab of Intelligent Computing and Signal Processing of Ministry of Education, Anhui University, Hefei, Anhui 230039, PR China (b) School of Management, Hefei University of Technology, Hefei, Anhui 230009, PR China (c) Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, USA Article History: Received 9 June 2014; Accepted 16 July 2015
subject
0Computer science
1Algorithms
2Research and Development in the Physical, Engineering, and Life Sciences (except Biotechnology)
3541712
4Algorithm
general
0English
1Elsevier Science Publishers
2Cengage Learning, Inc.
sourceidgale_ofa
recordidgale_ofa434848138
issn
00925-5273
109255273
rsrctypearticle
creationdate2015
startdate20151101
enddate20151101
recordtypearticle
addtitleInternational Journal of Production Economics
searchscopeOneFile
citationpf 1 vol 169
sort
titleEffective heuristic for makespan minimization in parallel batch machines with non-identical capacities.
authorJia, Zhao-Hong ; Li, Kai ; Leung, Joseph Y.-T.
creationdate20151101
lso0120151101
facets
frbrgroupid-8709186246692961999
frbrtype6
languageeng
creationdate2015
collectionOneFile (GALE)
prefilterarticles
rsrctypearticles
creatorcontrib
0Jia, Zhao-Hong
1Li, Kai
2Leung, Joseph Y.-T.
jtitleInternational Journal of Production Economics
toplevelpeer_reviewed
delivery
delcategoryRemote Search Resource
fulltextno_fulltext
addata
aulast
0Jia
1Li
2Leung
aufirst
0Zhao-Hong
1Kai
2Joseph Y.-T.
au
0Jia, Zhao-Hong
1Li, Kai
2Leung, Joseph Y.-T.
atitleEffective heuristic for makespan minimization in parallel batch machines with non-identical capacities
jtitleInternational Journal of Production Economics
risdate20151101
volume169
spage1
issn0925-5273
formatjournal
genrearticle
ristypeJOUR
abstractTo link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ijpe.2015.07.021 Byline: Zhao-hong Jia, Kai Li, Joseph Y.-T. Leung Abstract: We consider the problem of scheduling a set of n jobs with arbitrary job sizes on a set of m parallel batch machines with non-identical capacities; the objective is to minimize the makespan. The problem is known to be NP-hard. A heuristic based on the First-Fit-Decreasing (FFD) rule is presented as well as a meta-heuristic based on Max-Min Ant System (MMAS). The performances of the two heuristics are compared with a previously studied heuristic by computational experiments. The results show that both proposed algorithms outperform the previously studied heuristic. Moreover, the MMAS heuristic obtains better solutions compared with the FFD heuristic. Author Affiliation: (a) Key Lab of Intelligent Computing and Signal Processing of Ministry of Education, Anhui University, Hefei, Anhui 230039, PR China (b) School of Management, Hefei University of Technology, Hefei, Anhui 230009, PR China (c) Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, USA Article History: Received 9 June 2014; Accepted 16 July 2015
pubElsevier Science Publishers
lad01gale_ofa
date2015-11-01