Journal
APPLIED MATHEMATICAL MODELLING
Volume 36, Issue 2, Pages 846-858Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.apm.2011.07.037
Keywords
Mixed integer programming; Flexible job shop; Process plan flexibility; Sequence dependent setup
Ask authors/readers for more resources
The optimization optimization problem addressed in this paper is an advanced form of the flexible job shop scheduling problem (FJSP) which also covers process plan flexibility and separable/non-separable sequence dependent setup times in addition to routing flexibility. Upon transforming the problem into an equivalent network problem, two mixed integer goal programming models are formulated. In the first model (Model A) the sequence dependent setup times are non-separable. In the second one (Model B) they are separable. Model B is obtained from Model A with a minor modification. The formulation of the models is described on a small sized numerical example and the solutions are interpreted. Finally, computational results are obtained on test problems. (C) 2011 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available