Authors: J. K. Mane, K. P. Ghadle
Present work deals with analysis maintenance activity single-machine scheduling and due-date assignment simultaneously. The objective is to find the optimal maintenance position as well as the optimal location of the common due-date for minimizing the total of earliness, tardiness and due-date costs. We introduce a polynomial 0 (n4) time solution for the problem. To solve the scheduling problem addressed in this work, we have to determine the job sequence, the common due-date, and the location of a maintenance activity. We also present two special cases of the problem and show that they can be optimally solved by a lower order algorithm.
Comments: 11 Pages.
Download: PDF
[v1] 2014-05-07 23:53:15
Unique-IP document downloads: 204 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.