Online MTO lead-time scheduling: a probabilistic approach

Zu-Hsu Lee

International Journal of Operational Research, 2008, vol. 3, issue 1/2, 183-200

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.

Keywords: due date assignment; lead times; meta-heuristic; online scheduling; probabilistic analysis; queueing; make-to-order; MTO; customisation; weighted due dates. (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=16160 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:3:y:2008:i:1/2:p:183-200

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().