File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Flexible job-shop scheduling problem under resource constraints

TitleFlexible job-shop scheduling problem under resource constraints
Authors
KeywordsFlexible job-shop scheduling
Genetic algorithms
Operations-machines assignment
Resource constraints
Sequencing
Issue Date2006
PublisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207543.asp
Citation
International Journal Of Production Research, 2006, v. 44 n. 11, p. 125-143 How to Cite?
AbstractA flexible job-shop-scheduling problem is an extension of classical job-shop problems that permit an operation of each job to be processed by more than one machine. The research methodology is to assign operations to machines (assignment) and determine the processing order of jobs on machines (sequencing) such that the system objectives can be optimized. This problem can explore very well the common nature of many real manufacturing environments under resource constraints. A genetic algorithm-based approach is developed to solve the problem. Using the proposed approach, a resource-constrained operations-machines assignment problem and flexible job-shop scheduling problem can be solved iteratively. In this connection, the flexibility embedded in the flexible shop floor, which is important to today's manufacturers, can be quantified under different levels of resource availability.
Persistent Identifierhttp://hdl.handle.net/10722/74324
ISSN
2015 Impact Factor: 1.693
2015 SCImago Journal Rankings: 1.445
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorChan, FTSen_HK
dc.contributor.authorWong, TCen_HK
dc.contributor.authorChan, LYen_HK
dc.date.accessioned2010-09-06T07:00:13Z-
dc.date.available2010-09-06T07:00:13Z-
dc.date.issued2006en_HK
dc.identifier.citationInternational Journal Of Production Research, 2006, v. 44 n. 11, p. 125-143en_HK
dc.identifier.issn0020-7543en_HK
dc.identifier.urihttp://hdl.handle.net/10722/74324-
dc.description.abstractA flexible job-shop-scheduling problem is an extension of classical job-shop problems that permit an operation of each job to be processed by more than one machine. The research methodology is to assign operations to machines (assignment) and determine the processing order of jobs on machines (sequencing) such that the system objectives can be optimized. This problem can explore very well the common nature of many real manufacturing environments under resource constraints. A genetic algorithm-based approach is developed to solve the problem. Using the proposed approach, a resource-constrained operations-machines assignment problem and flexible job-shop scheduling problem can be solved iteratively. In this connection, the flexibility embedded in the flexible shop floor, which is important to today's manufacturers, can be quantified under different levels of resource availability.en_HK
dc.languageengen_HK
dc.publisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207543.aspen_HK
dc.relation.ispartofInternational Journal of Production Researchen_HK
dc.subjectFlexible job-shop schedulingen_HK
dc.subjectGenetic algorithmsen_HK
dc.subjectOperations-machines assignmenten_HK
dc.subjectResource constraintsen_HK
dc.subjectSequencingen_HK
dc.titleFlexible job-shop scheduling problem under resource constraintsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0020-7543&volume=44&issue=11&spage=2071&epage=2089&date=2006&atitle=Flexible+job-shop+scheduling+problem+under+resource+constraintsen_HK
dc.identifier.emailChan, FTS: ftschan@hkucc.hku.hken_HK
dc.identifier.emailChan, LY: plychan@hku.hken_HK
dc.identifier.authorityChan, FTS=rp00090en_HK
dc.identifier.authorityChan, LY=rp00093en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1080/00207540500386012en_HK
dc.identifier.scopuseid_2-s2.0-33646400835en_HK
dc.identifier.hkuros119213en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33646400835&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume44en_HK
dc.identifier.issue11en_HK
dc.identifier.spage125en_HK
dc.identifier.epage143en_HK
dc.identifier.isiWOS:000237603900001-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridChan, FTS=7202586517en_HK
dc.identifier.scopusauthoridWong, TC=9246060100en_HK
dc.identifier.scopusauthoridChan, LY=7403540482en_HK
dc.identifier.citeulike607224-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats