Two-machine flowshop scheduling with flexible operations and controllable processing times

Simple item page
dc.citation.epage653en_US
dc.citation.issueNumber2en_US
dc.citation.spage639en_US
dc.citation.volumeNumber40en_US
dc.contributor.authorUruk, Z.en_US
dc.contributor.authorGultekin H.en_US
dc.contributor.authorAkturk, M. S.en_US
dc.date.accessioned2016-02-08T09:41:12Z
dc.date.available2016-02-08T09:41:12Z
dc.date.issued2013en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractWe consider a two-machine flowshop scheduling problem with identical jobs. Each of these jobs has three operations, where the first operation must be performed on the first machine, the second operation must be performed on the second machine, and the third operation (named as flexible operation) can be performed on either machine but cannot be preempted. Highly flexible CNC machines are capable of performing different operations. Furthermore, the processing times on these machines can be changed easily in albeit of higher manufacturing cost by adjusting the machining parameters like the speed and/or feed rate of the machine. The overall problem is to determine the assignment of the flexible operations to the machines and processing times for each operation to minimize the total manufacturing cost and makespan simultaneously. For such a bicriteria problem, there is no unique optimum but a set of nondominated solutions. Using ε-constraint approach, the problem could be transformed to be minimizing total manufacturing cost for a given upper limit on the makespan. The resulting single criterion problem can be reformulated as a mixed integer nonlinear problem with a set of linear constraints. We use this formulation to optimally solve small instances of the problem while a heuristic procedure is constructed to solve larger instances in a reasonable time.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T09:41:12Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2013en
dc.identifier.doi10.1016/j.cor.2012.09.001en_US
dc.identifier.eissn1873-765X
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/11693/21102
dc.language.isoEnglishen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.cor.2012.09.001en_US
dc.source.titleComputers and Operations Researchen_US
dc.subjectControllable processing timesen_US
dc.subjectFlexible manufacturing systemen_US
dc.subjectFlowshopen_US
dc.subjectSchedulingen_US
dc.subjectBicriteria problemsen_US
dc.subjectCNC machineen_US
dc.subjectControllable processing timeen_US
dc.subjectFeed-ratesen_US
dc.subjectFlexible operationen_US
dc.subjectFlow-shopsen_US
dc.subjectHeuristic proceduresen_US
dc.subjectIdentical jobsen_US
dc.subjectLinear constraintsen_US
dc.subjectMachining parametersen_US
dc.subjectMakespanen_US
dc.subjectManufacturing costen_US
dc.subjectMixed integer nonlinear problemsen_US
dc.subjectNondominated solutionsen_US
dc.subjectProcessing timeen_US
dc.subjectTwo-machine flowshopen_US
dc.subjectUpper limitsen_US
dc.subjectComputer control systemsen_US
dc.subjectFlexible manufacturing systemsen_US
dc.subjectHeuristic methodsen_US
dc.subjectScheduling algorithmsen_US
dc.subjectSchedulingen_US
dc.titleTwo-machine flowshop scheduling with flexible operations and controllable processing timesen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Two-machine_flowshop_scheduling_with_flexible_operations_and_controllable_processing_times.pdf
Size:
644.05 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Industrial Engineering