Dynamic Pareto-optimal group scheduling for a single machine
by Yuri Mauergauz
International Journal of Industrial and Systems Engineering (IJISE), Vol. 16, No. 4, 2014

Abstract: This paper seeks to determine a dynamic Pareto-optimal method for a single machine scheduling based on two criteria simultaneously: setup expenditure criterion and average orders utility criterion. Series-batch and parallel-batch problems with sequence-dependent setup times are considered. In this method the concept of production intensity as dynamic production process parameter is used. A set of applied software allows scheduling for middle quantity of jobs. The result of software application is the set of non-dominant versions proposed to a user for making a final choice.

Online publication date: Sat, 07-Jun-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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