An anticipative scheduling approach with controllable processing times

Simple item page
dc.citation.epage1013en_US
dc.citation.issueNumber6en_US
dc.citation.spage1002en_US
dc.citation.volumeNumber37en_US
dc.contributor.authorGürel, S.en_US
dc.contributor.authorKörpeoǧlu, E.en_US
dc.contributor.authorAktürk, M. S.en_US
dc.date.accessioned2016-02-08T09:58:20Z
dc.date.available2016-02-08T09:58:20Z
dc.date.issued2010en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractIn practice, machine schedules are usually subject to disruptions which have to be repaired by reactive scheduling decisions. The most popular predictive approach in project management and machine scheduling literature is to leave idle times (time buffers) in schedules in coping with disruptions, i.e. the resources will be under-utilized. Therefore, preparing initial schedules by considering possible disruption times along with rescheduling objectives is critical for the performance of rescheduling decisions. In this paper, we show that if the processing times are controllable then an anticipative approach can be used to form an initial schedule so that the limited capacity of the production resources are utilized more effectively. To illustrate the anticipative scheduling idea, we consider a non-identical parallel machining environment, where processing times can be controlled at a certain compression cost. When there is a disruption during the execution of the initial schedule, a match-up time strategy is utilized such that a repaired schedule has to catch-up initial schedule at some point in future. This requires changing machine-job assignments and processing times for the rest of the schedule which implies increased manufacturing costs. We show that making anticipative job sequencing decisions, based on failure and repair time distributions and flexibility of jobs, one can repair schedules by incurring less manufacturing cost. Our computational results show that the match-up time strategy is very sensitive to initial schedule and the proposed anticipative scheduling algorithm can be very helpful to reduce rescheduling costs.en_US
dc.identifier.doi10.1016/j.cor.2009.09.001en_US
dc.identifier.eissn1873-765X
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/11693/22304
dc.language.isoEnglishen_US
dc.publisherElsevieren_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.cor.2009.09.001en_US
dc.source.titleComputers & Operations Researchen_US
dc.subjectAnticipative schedulingen_US
dc.subjectControllable processing timesen_US
dc.subjectReactive schedulingen_US
dc.subjectMatch-up timeen_US
dc.titleAn anticipative scheduling approach with controllable processing timesen_US
dc.typeArticleen_US

Files

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

Collections

Department of Industrial Engineering