Parallel machine match-up scheduling with manufacturing cost considerations
Author
Aktürk, M. S.
Atamtürk, A.
Gürel, S.
Date
2010Source Title
Journal of Scheduling
Print ISSN
1094-6136
Electronic ISSN
1099-1425
Publisher
Springer
Volume
13
Issue
1
Pages
95 - 110
Language
English
Type
ArticleItem Usage Stats
111
views
views
90
downloads
downloads
Abstract
Many 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.
Keywords
Parallel machine reschedulingMatch up times
Controllable processing times
Second-order cone programming