Abstract
The research presented concerns the policy to manage a job shop in which the machines have controllable processing times. A controllable processing time means that it can be reduced processing time by using additional resources. The model proposed is based on a multi-agent architecture that supports the manufacturing system. The policy proposed concerns the evaluation of the workload of the resources. It is necessary to define the following issues for the controllable time process of a resource: the condition of start and the duration of the process time reduction. Two approaches are proposed to assign the resources to the machines. The first approach concerns the reduction of the processing time one machine at time, while the second approach distributes the additional resources proportionally among the machines. A simulation environment is developed to test the proposed approach in several dynamic conditions. The simulation results show that the control of the processing times proposed allows to improve significantly the performance.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Agnetis A, Mirchandani PB, Pacciarelli D, Pacifici A (2000) Nondominated schedules for a job-shop with two competing agents. Comput Math Organ Theory 6(2):191–217
Agnetis A, Mirchandani PB, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52(2):229–242
Akturk MS, Ghoshb JB, Kayana RK (2007) Scheduling with tool changes to minimize total completion time under controllable machining conditions. Comput Oper Res 34:2130–2146
Behnamian J, Fatemi Ghomi SMT (2011) Hybrid flowshop scheduling with machine and resource-dependent processing times. Appl Math Model 35(3):1107–1123
Choi B-C, Leung JY-T, Pinedo ML (2010) Complexity of a scheduling problem with controllable processing times. Oper Res Lett 38(2):123–126
Gürel S, Körpeoğlu E, Selim AM (2010) An anticipative scheduling approach with controllable processing times. Comput Oper Res 37(6):1002–1013
Janiak A (1989) Minimization of the blooming mill standstills—mathematical model, suboptimal algorithms. Mechanika 8(2):37–49
Jansen K, Mastrolilli M, Solis-Oba R (2001) Job shop scheduling problems with controllable processing times. Lect Notes Comput Sci 2202(2001):107–122
Jansen K, Mastrolilli M, Solis-Oba R (2005) Approximation schemes for job shop scheduling problems with controllable processing times. Eur J Oper Res 167:297–319
Kaspi M, Shabtay D (2003) Optimization of machining economics problem for a multi-stage transfer machine under failure, opportunistic and integrated replacement strategies. Int J Prod Res 41:2229–2248
Kayan RK, Akturk MS (2005) A new bounding mechanism for the CNC machine scheduling problem with controllable processing times. Eur J Oper Res 167:624–643
Kelton WD, Sadowski RP, Swets NB (2010) Simulation with Arena, 5th edn. McGraw-Hill, New York
Liu P, Tang L, Zhou X (2010) Two-agent group scheduling with deteriorating jobs on a single machine. Int J Adv Manuf Technol 47(5–8):657–664
Luo X, Li W, Tu Y, Xue D, Tang J (2010) Optimal resource allocation for hybrid flow shop in one-of-a-kind production. Int J Comput Integr Manuf 23(2):146–154
Mokhtari H, Abadi INK, Cheraghalikhani A (2011) A multi-objective flow shop scheduling with resource-dependent processing times: trade-off between makespan and cost of resources. Int J Prod Res 49(19):5851–5875
Nearchou AC (2010) Scheduling with controllable processing times and compression costs using population-based heuristics. Int J Prod Res 48(23):7043–7062
Niu G, Sun S, Lafon P, Zhang Y, Wang J (2012) Two decompositions for the bicriteria job-shop scheduling problem with discretely controllable processing times. Int J Prod Res. doi:10.1080/00207543.2011.651169
Renna P (2011) Multi-agent based scheduling in manufacturing cells in a dynamic environment. Int J Prod Res 49(5):1285–1301
Selim AM, Taylan IT (2011) Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness. Comput Oper Res 17(10):533–541
Shabtay D, Steiner G (2007) A survey of scheduling with controllable processing times. Discret Appl Math 155:1643–1666
Shabtay D, Steiner G (2008) The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times. Ann Oper Res 159(1):25–40
Turkcan A, Akturk MS, Storer RH (2007) Due date and cost-based FMS loading, scheduling and tool management. Int J Prod Res 45(5):1183–1213
Uruk Z, Gultekin H, Selim Akturk MS (2013) Two-machine flowshop scheduling with flexible operations and controllable processing times. Comput Oper Res 40(2):639–653
Yildiz S, Akturk MS, Karasan OE (2011) Bicriteria robotic cell scheduling with controllable processing times. Int J Prod Res 49(2):569–583
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Renna, P. Controllable processing time policies for job shop manufacturing system. Int J Adv Manuf Technol 67, 2127–2136 (2013). https://doi.org/10.1007/s00170-012-4635-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-012-4635-9