Parallel machine match-up scheduling with manufacturing cost considerations

Creative Commons License

Akturk M. S., Atamturk A., Gurel S.

JOURNAL OF SCHEDULING, vol.13, no.1, pp.95-110, 2010 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 13 Issue: 1
  • Publication Date: 2010
  • Doi Number: 10.1007/s10951-009-0111-2
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.95-110
  • Keywords: Parallel machine rescheduling, Match up times, Controllable processing times, Second-order cone programming, CONTROLLABLE PROCESSING TIMES, SINGLE-MACHINE, ALLOCATION, SYSTEMS
  • Middle East Technical University Affiliated: Yes


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 matchup time and manufacturing cost criteria. We introduce alternative match-up scheduling problems for finding schedules on the efficient frontier of this time/cost tradeoff.