University of SaskatchewanHARVEST
  • Login
  • Submit Your Research
  • About
    • About HARVEST
    • Guidelines
    • Browse
      • All of HARVEST
      • Communities & Collections
      • By Issue Date
      • Authors
      • Titles
      • Subjects
      • This Collection
      • By Issue Date
      • Authors
      • Titles
      • Subjects
    • My Account
      • Login
      JavaScript is disabled for your browser. Some features of this site may not work without it.
      View Item 
      • HARVEST
      • Electronic Theses and Dissertations
      • Graduate Theses and Dissertations
      • View Item
      • HARVEST
      • Electronic Theses and Dissertations
      • Graduate Theses and Dissertations
      • View Item

      A permutation flowshop model with time-lags and waiting time preferences of the patients

      Thumbnail
      View/Open
      RAMEZANI-THESIS-2019.pdf (1.548Mb)
      Date
      2019-02-05
      Author
      Ramezani, Iman
      Type
      Thesis
      Degree Level
      Masters
      Metadata
      Show full item record
      Abstract
      The permutation flowshop is a widely applied scheduling model. In many real-world applications of this model, a minimum and maximum time-lag must be considered between consecutive operations. We can apply this model to healthcare systems in which the minimum time-lag could be the transfer times, while the maximum time-lag could refer to the number of hours patients must wait. We have modeled a MILP and a constraint programming model and solved them using CPLEX to find exact solutions. Solution times for both methods are presented. We proposed two metaheuristic algorithms based on genetic algorithm and solved and compared them with each other. A sensitivity of analysis of how a change in minimum and maximum time-lags can impact waiting time and Cmax of the patients is performed. Results suggest that constraint programming is a more efficient method to find exact solutions and changes in the values of minimum and maximum time-lags can impact waiting times of the patients and Cmax significantly.
      Degree
      Master of Science (M.Sc.)
      Department
      Finance
      Program
      Finance
      Supervisor
      Samarghandi, Hamed; Willoughby, Keith
      Committee
      Hojati, Mehran; Almehdawe, Eman
      Copyright Date
      January 2019
      URI
      http://hdl.handle.net/10388/11872
      Subject
      Waiting times of the patients
      Healthcare scheduling
      Constraint programming
      Genetic algorithm
      Collections
      • Graduate Theses and Dissertations
      University of Saskatchewan

      University Library

      © University of Saskatchewan
      Contact Us | Disclaimer | Privacy