Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • Collection Policy
        • OA Mandate Guidelines
        • Guidelines FAQ
        • Contact Us
      • My Account 
        • Sign In
        • Register
      View Item 
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Optimal task scheduling in a flexible manufacturing system using model checking

      Malik, Robi; Pena, Patricia N.
      Thumbnail
      Files
      Optimal task scheduling paper.pdf
      Published version, 801.8Kb
      Citation
      Export citation
      Malik, R., & Pena, P. N. (2018). Optimal task scheduling in a flexible manufacturing system using model checking. In F. Basile, C. Hadjicostis, J. Komenda, & G. De Tommasi (Eds.), Preprints: 14 Workshop on Discrete Event Systems (WODES 2018) (pp. 241–246). Sorrento Coast, Italy.
      Permanent Research Commons link: https://hdl.handle.net/10289/13036
      Abstract
      This paper demonstrates the use of model checking to solve the problem of optimal task scheduling in a flexible manufacturing system. The system is modelled as a discrete event system, for which the least restrictive safe behaviour is synthesised according to supervisory control theory. Then timing constraints are added to the model in the form of extended finitestate machines, and time-optimal schedules are computed using the discrete event systems and model checking tool Supremica. In the case study considered in this paper, which previously was only solved heuristically, the method successfully produces optimal schedules to manufacture up to 30 products of two different types. The method is furthermore used to find an optimal cycle, solving the scheduling problem of the case study for an arbitrary number of products in optimal or asymptotically close to optimal time.
      Date
      2018
      Type
      Conference Contribution
      Rights
      © 2018 IFAC
      Collections
      • Computing and Mathematical Sciences Papers [1454]
      Show full item record  

      Usage

      Downloads, last 12 months
      62
       
       

      Usage Statistics

      For this itemFor all of Research Commons

      The University of Waikato - Te Whare Wānanga o WaikatoFeedback and RequestsCopyright and Legal Statement