Scheduling in stochastic bicriteria single machine systems with set-up times Online publication date: Sat, 31-Dec-2011
by H.M. Soroush
International Journal of Planning and Scheduling (IJPS), Vol. 1, No. 1/2, 2011
Abstract: This paper deals with a single machine scheduling problem where job attributes are random variables, setup times are sequence-dependent, and a scheduler utilises a cost function to evaluate two criteria associated with a sequence. The objective is to determine the optimal sequence that minimises the scheduler's expected cost. We show that problem scenarios wherein cost functions are linear, exponential, and fractional can be formulated as Quadratic Assignment Problems (QAPs). Also, special cases with sequence-independent setup times are shown to be solvable optimally in polynomial time. Our computational results on scenarios with sequence-dependent setup times demonstrate that good solutions can be approximated within reasonable amounts of time.
Online publication date: Sat, 31-Dec-2011
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 International Journal of Planning and Scheduling (IJPS):
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 firstname.lastname@example.org