On the assignment problem of arbitrary processing time operations in partially overlapping manufacturing resources

DOIResolve DOI: http://doi.org/10.1109/CoASE.2012.6386373
AuthorSearch for: ; Search for: ; Search for:
Proceedings titleIEEE International Conference on Automation Science and Engineering (CASE), 2012 20-24 Aug. 2012, Seoul, Korea
Conference2012 IEEE International Conference on Automation Science and Engineering (CASE 2012), 20-24 August 2012, Seoul, Korea (South)
Pages341346; # of pages: 6
Subjectjob shop scheduling; machine tools; manufacturing resources planning; resource allocation
AbstractThe frequent transfers' challenge of workpieces between multiple resources is quite evident in the production process of customized parts. In fact, special jobs' transfers and processing, often, require workpiece unloading, transport and loading with, rather, idling and reconfiguration of resources that impact much job completion time and resource utilization. The overlapping capabilities of machine tools, otherwise, are common with, typically, few special tooling. In such settings, the overlapping and special tooling capabilities intensify the complexity of the assignment problem, mainly, when allocating the operations of arbitrary processing times. This work targets the efficient assignment of unrelated jobs of operations with arbitrary processing time to multiple resources of partially overlapping capabilities. The work introduces a formal model and a more efficient solution approach for minimizing jobs' transfer and balancing workloads. The sequencing problem of the assigned unrelated jobs would be, then, an orthogonal problem, of less significance, that can be tackled separately.
Publication date
AffiliationConstruction; National Research Council Canada
Peer reviewedYes
NPARC number21269091
Export citationExport as RIS
Report a correctionReport a correction
Record identifier894dc329-cb99-4959-9767-cbfae79fce92
Record created2013-12-05
Record modified2017-05-17
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)
Date modified: