ViraScience.
Article

a knowledge-based nsga-ii approach for scheduling in virtual manufacturing cells

m. zandieh, department of industrial management, management and accounting faculty, shahid beheshti university, g. c., tehran, iran.

Abstract

this paper considers the job scheduling problem in virtual manufacturing cells (vmcs) with the goal of minimizing two objectives namely, makespan and total travelling distance. to solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (nsga-ii) and knowledge-based non-dominated sorting genetic algorithm (kbnsga-ii). the difference between these algorithms is that, kbnsga-ii has an additional learning module. finally, we draw an analogy between the results obtained from algorithms applied to various test problems. the superiority of our kbnsga-ii, based on set coverage and mean ideal distance metrics, is inferred from results.

Similar items

  • A knowledge-based NSGA-II approach for scheduling in virtual manufacturing cells

    Article2016Journal of Industrial Engineering and Management StudiesM. Zandieh

    This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm

  • Virtual manufacturing cells scheduling considering lotstreaming and sequence dependent setup times

    Article2015Journal of Industrial Engineering and Management StudiesA. Ayooq, A. Alem Tabriz, A. Javani

    In this paper, a new mathematical model for the problem of job scheduling in virtual manufacturing cells (VMC) is presented to minimizing the completion time of all jobs. Sequence dependent setup times of machines is considered and lot-streaming is possible. In Virtual manufactur

  • Composite Schedules of Manufacturing Cells and Their Timed Petri Net Models

    Scholarly record2015W. M. Zuberek

    Composite schedules of manufacturing cells and their timed Petri net models 2991 are quite satisfactory [2]. In particular, the throughput (or the cycle time) of a timed net model can easily be determined from the structure of a net [7]. This paper presents a systematic method of

  • Timed Petri Nets in Modeling and Analysis of Simple Schedules for Manufacturing Cells

    Scholarly record2003W. M. ZUBEREK, W. KUBIAK

    K e y w o r d s F l e x i b l e manufacturing systems, Schedules for manufacturing cells, Performance evaluation, Timed Petri nets, Net invariant analysis. 1. I N T R O D U C T I O N Flexible manufac tu r ing systems are discrete-event systems which are composed of (i) a set of v

  • Modeling Simple Schedules of Manufacturing Cells Using Timed Petri Nets

    Scholarly record2015W. M. Zuberek, W. Kubiak

    It is shown that a large class of flexible manufacturing cells can be modeled using timed Petri nets. Net models of simple schedules (i.e., schedules in which exactly one part enter and one leaves the cell during each cycle) are conflict–free nets. Invariant analysis of such mode

  • Virtual Manufacturing Cell Formation Problem (vmcfp) in a Distributed Layout

    Scholarly record2007A. R. Xambre, P. M. Vilarinho

    There are essentially two ways to implement a Cellular Manufacturing System (CMS): physical and logical. In the first case, the machines are laid out in the floor space in dedicated manufacturing cells to exploit flow shop efficiency in processing part families, whereas in the se