Minimising mean squared deviation of job completion times about a common due date in multimachine systems
AbstractIn 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]
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Inderscience Enterprises Ltd in its journal European J. of Industrial Engineering.
Volume (Year): 5 (2011)
Issue (Month): 4 ()
Contact details of provider:
Web page: http://www.inderscience.com/browse/index.php?journalID=210
multi-machine scheduling; mean squared deviation; MSD; branch and bound; job completion times; common due dates.;
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Graham Langley) or (Christopher F. Baum).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.