@article{(Open Science Index):https://publications.waset.org/pdf/4933,
	  title     = {Minimizing Makespan Subject to Budget Limitation in Parallel Flow Shop},
	  author    = {Amin Sahraeian},
	  country	= {},
	  institution	= {},
	  abstract     = {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.},
	    journal   = {International Journal of Industrial and Manufacturing Engineering},
	  volume    = {6},
	  number    = {8},
	  year      = {2012},
	  pages     = {1661 - 1664},
	  ee        = {https://publications.waset.org/pdf/4933},
	  url   	= {https://publications.waset.org/vol/68},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 68, 2012},
	}