Parallel machine match-up scheduling with manufacturing cost considerations

Simple item page
dc.citation.epage110en_US
dc.citation.issueNumber1en_US
dc.citation.spage95en_US
dc.citation.volumeNumber13en_US
dc.contributor.authorAktürk, M. S.en_US
dc.contributor.authorAtamtürk, A.en_US
dc.contributor.authorGürel, S.en_US
dc.date.accessioned2016-02-08T10:00:04Z
dc.date.available2016-02-08T10:00:04Z
dc.date.issued2010en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractMany scheduling problems in practice involve rescheduling of disrupted schedules. In this study, we show that in contrast to fixed processing times, if we have the flexibility to control the processing times of the jobs, we can generate alternative reactive schedules considering the manufacturing cost implications in response to disruptions. We consider a non-identical parallel machining environment where processing times of the jobs are compressible at a certain manufacturing cost, which is a convex function of the compression on the processing time. In rescheduling it is highly desirable to catch up the original schedule as soon as possible by reassigning the jobs to the machines and compressing their processing times. On the other hand, one must also keep the manufacturing cost due to compression of the jobs low. Thus, one is faced with a tradeoff between match-up time and manufacturing cost criteria. We introduce alternative match-up scheduling problems for finding schedules on the efficient frontier of this time/cost tradeoff. We employ the recent advances in conic mixed-integer programming to model these problems effectively. We further provide a fast heuristic algorithm driven by dual prices of convex subproblems for generating approximate efficient schedules.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:00:04Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2010en
dc.identifier.doi10.1007/s10951-009-0111-2en_US
dc.identifier.eissn1099-1425
dc.identifier.issn1094-6136
dc.identifier.urihttp://hdl.handle.net/11693/22437
dc.language.isoEnglishen_US
dc.publisherSpringeren_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/s10951-009-0111-2en_US
dc.source.titleJournal of Schedulingen_US
dc.subjectParallel machine reschedulingen_US
dc.subjectMatch up timesen_US
dc.subjectControllable processing timesen_US
dc.subjectSecond-order cone programmingen_US
dc.titleParallel machine match-up scheduling with manufacturing cost considerationsen_US
dc.typeArticleen_US

Files

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

Collections

Scholarly Publications - Industrial Engineering