• About
  • Policies
  • What is open access
  • 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.

      Two-machine flowshop scheduling with flexible operations and controllable processing times

      Thumbnail
      View / Download
      644.1 Kb
      Author(s)
      Uruk, Z.
      Gultekin H.
      Akturk, M. S.
      Date
      2013
      Source Title
      Computers and Operations Research
      Print ISSN
      0305-0548
      Electronic ISSN
      1873-765X
      Volume
      40
      Issue
      2
      Pages
      639 - 653
      Language
      English
      Type
      Article
      Item Usage Stats
      136
      views
      127
      downloads
      Abstract
      We consider a two-machine flowshop scheduling problem with identical jobs. Each of these jobs has three operations, where the first operation must be performed on the first machine, the second operation must be performed on the second machine, and the third operation (named as flexible operation) can be performed on either machine but cannot be preempted. Highly flexible CNC machines are capable of performing different operations. Furthermore, the processing times on these machines can be changed easily in albeit of higher manufacturing cost by adjusting the machining parameters like the speed and/or feed rate of the machine. The overall problem is to determine the assignment of the flexible operations to the machines and processing times for each operation to minimize the total manufacturing cost and makespan simultaneously. For such a bicriteria problem, there is no unique optimum but a set of nondominated solutions. Using ε-constraint approach, the problem could be transformed to be minimizing total manufacturing cost for a given upper limit on the makespan. The resulting single criterion problem can be reformulated as a mixed integer nonlinear problem with a set of linear constraints. We use this formulation to optimally solve small instances of the problem while a heuristic procedure is constructed to solve larger instances in a reasonable time.
      Keywords
      Controllable processing times
      Flexible manufacturing system
      Flowshop
      Scheduling
      Bicriteria problems
      CNC machine
      Controllable processing time
      Feed-rates
      Flexible operation
      Flow-shops
      Heuristic procedures
      Identical jobs
      Linear constraints
      Machining parameters
      Makespan
      Manufacturing cost
      Mixed integer nonlinear problems
      Nondominated solutions
      Processing time
      Two-machine flowshop
      Upper limits
      Computer control systems
      Flexible manufacturing systems
      Heuristic methods
      Scheduling algorithms
      Scheduling
      Permalink
      http://hdl.handle.net/11693/21102
      Published Version (Please cite this version)
      http://dx.doi.org/10.1016/j.cor.2012.09.001
      Collections
      • Department of Industrial Engineering 702
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      LoginRegister

      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
      © Bilkent University - Library IT

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