 Minimising mean squared deviation of job completion times about a common due date in multimachine systemsB. Srirangacharyulu and G. Srinivasan European Journal of Industrial Engineering, 2011, vol. 5, issue 4, 424-447 Abstract: In this paper we consider the problem of scheduling n jobs on two identical parallel machines in order to minimise the mean squared deviation (MSD) of job completion times about a given common due date. When due dates are small and large deviations of job completion times from the due dates are undesirable, it becomes necessary to consider parallel machines. MSD comes under the category of non-regular performance measures, which penalises jobs that are early as well as late. In this paper we develop a lower bound on MSD for a given partial schedule and present a branch and bound algorithm to solve the problem. Optimal solutions for problem instances up to 35 jobs have been obtained for different values of due dates and the results of computational testing are presented. Based on our experiments we observe that when the due date exceeds a certain value the second machine becomes undesirable. We also propose a heuristic to provide quick solutions for problems of larger size. [Received: 25 July 2009; Revised: 30 March 2010, 1 June 2010; Accepted: 5 June 2010] Keywords: multi-machine scheduling; mean squared deviation; MSD; branch and bound; job completion times; common due dates. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:eujine:v:5:y:2011:i:4:p:424-447 Access Statistics for this article More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.