Minimizing Makespan Subject to Budget Limitation in Parallel Flow Shop

One of the criteria in production scheduling is Make Span, minimizing this criteria causes more efficiently use of the resources specially machinery and manpower. By assigning some budget to some of the operations the operation time of these activities reduces and affects the total completion time of all the operations (Make Span). In this paper this issue is practiced in parallel flow shops. At first we convert parallel flow shop to a network model and by using a linear programming approach it is identified in order to minimize make span (the completion time of the network) which activities (operations) are better to absorb the predetermined and limited budget. Minimizing the total completion time of all the activities in the network is equivalent to minimizing make span in production scheduling.

Authors:

• Amin Sahraeian

Keywords:

• parallel flow shop
• make span
• linear programming
• budget

References:

[1] S.M.H. Hojjati, and A. Sahraeyan," Minimizing Makespan Subject to
Budget Limitation in Hybrid Flow-Shop," 39th International Conference
on Computer and Industrial Engineering, Troyes, France 6-8 July 2009,
pp 18-22.
[2] W. Bozejko, and J. Pempera,"Parallel tabu search algorithm for the
permutation flow shop problem with criterion of minimizing sum of job
completion times," Human System Interactions, Conference in Kralow
25-27 May 2008; 825-829.
[3] X. Zhang,and S.van de Velde," Approximation Algorithms for the
Parallel Flow Shop Problem," European Journal of Operational
Research (2011)B. Smith, "An approach to graphs of linear forms
(Unpublished work style)," unpublished.
[4] M. Seda," Mathematical Models of Flow Shop and Job Shop
Scheduling Problems," World Academy of Science, Engineering and
Technology 31 2007.
[5] B. Al-Dulaomi, and A.Ali, . "A Novel Genetic Algorithm Approach for
Solving Flow Shop Problem," International Journal of Computer
Science and Network Security,2008, Vol. 8, No.9, pp. 229-235.
[6] H.G. Campbell, H.G. Dudeck, M.L. Smith," A Heuristic Algorithm for
the n Job, m Machine Sequencing Problem," Management Science,
No.16, pp. 630-637.
[7] J. Havill, and W. Mao," On-line Algorithms for hybrid Flow Shop
Scheduling, "2002.
[8] A. Khodadadi," Solving Constrained Flow-Shop Scheduling Problem
with Three Machines," International Journal of Academic Research,
2011, Vol. 3, No. 1, pp. 31 38-40.