Online MTO lead-time scheduling: a probabilistic approach
by Zu-Hsu Lee
International Journal of Operational Research (IJOR), Vol. 3, No. 1/2, 2008

Abstract: This paper considers a lead time (or due date) scheduling problem faced by a manufacturer that produces customised products according to specific customer orders. It uses a single sever model to design an effective, yet simple heuristic procedures for both sequencing and lead time determination decisions. Typically, a series of jobs with individual arrival times and weights must be sequenced on a single machine. With each arrival, a lead time must be determined, and the job completed before the promised due date. An on-line heuristic may be developed in certain situations, based on limited information about the future, with the objective of minimising the average (or total) weighted due date for large size instances. Computational testing shows that this heuristic is more effective than the conventional scheduling rules not only for the average weighted due date, but also for the average weighted lead time, for both stable systems and heavily loaded ones.

Online publication date: Fri, 07-Dec-2007

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 Operational Research (IJOR):
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