Multicriteria scheduling with controllable processing times, setup times, and learning, ageing and deterioration effects on a single machine Online publication date: Thu, 04-Aug-2016
by H.M. Soroush
European J. of Industrial Engineering (EJIE), Vol. 10, No. 4, 2016
Abstract: This paper addresses several multicriteria single machine scheduling problems wherein a job processing time is either a convex or linear function of the amount of resource assigned to the job, learning and ageing are job-dependent and position-based, job deterioration linearly depends on the job starting time, and the job's setup time is proportional to the duration of the already processed jobs. The goal is to jointly determine the optimal resource allocations and the optimal sequence with respect to the total resource cost and a composite cost function of some criteria. We formulate the proposed multicriteria problems as constrained and unconstrained combinatorial optimisation models and introduce polynomial time algorithms to derive the optimal solutions. [Received 1 October 2015; Revised 26 November 2015; Accepted 10 February 2016]
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com