• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Parallel machine match-up scheduling with manufacturing cost considerations

      Thumbnail
      View / Download
      621.4 Kb
      Author
      Aktürk, M. S.
      Atamtürk, A.
      Gürel, S.
      Date
      2010
      Source Title
      Journal of Scheduling
      Print ISSN
      1094-6136
      Electronic ISSN
      1099-1425
      Publisher
      Springer
      Volume
      13
      Issue
      1
      Pages
      95 - 110
      Language
      English
      Type
      Article
      Item Usage Stats
      111
      views
      90
      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 rescheduling
      Match up times
      Controllable processing times
      Second-order cone programming
      Permalink
      http://hdl.handle.net/11693/22437
      Published Version (Please cite this version)
      http://dx.doi.org/10.1007/s10951-009-0111-2
      Collections
      • Department of Industrial Engineering 684
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      Copyright © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy