Loading...

A self-adaptive PSO for joint lot sizing and job shop scheduling with compressible process times

Karimi Nasab, M ; Sharif University of Technology | 2015

549 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.asoc.2014.10.015
  3. Publisher: Elsevier Ltd , 2015
  4. Abstract:
  5. This paper presents mathematical modeling of joint lot sizing and scheduling problem in a job shop environment under a set of realistic working conditions. One main realistic assumption of the current study is dealing with flexible machines able to change their working speeds, known as process compressibility. The production schedules should be subject to limited available time in every planning period. Also, the model assumes that periodical sequences should be determined in a way that they obey from a fixed global sequence. Another complicating aspect of the problem is about consideration of precedence relationships for the needed processes of an item type over the corresponding machines. As the problem is proved to be strongly NP-hard, it is solved by a particle swarm optimization (PSO) algorithm. The proposed algorithm is self-controller about its working parameters, time to stop the search process, search diversification/intensification, and totally about its behavior. Performance of the algorithm is verified in terms of optimality gap using Lingo 11.0 on a set of randomly generated test data
  6. Keywords:
  7. Compressibility ; Production control ; Scheduling ; Job shop ; Job shop environment ; Lot sizing ; Lot-sizing and scheduling ; Precedence relationships ; Process compressibilities ; Production schedule ; Self-adaptivity ; Particle swarm optimization (PSO)
  8. Source: Applied Soft Computing Journal ; Volume 27 , Sharif University of Technology , 2015 , Pages 137-147 ; 15684946 (ISSN)
  9. URL: http://www.sciencedirect.com/science/article/pii/S1568494614005250