 Minimizing total tardiness for the order scheduling problemIk Sun Lee International Journal of Production Economics, 2013, vol. 144, issue 1, 128-134 Abstract: This paper considers the order scheduling problem to minimize total tardiness. The system is composed of multiple machines, and each order consists of multiple components, with each component being manufactured on a dedicated machine (specified in advance). The completion time of each order is represented by the time at which all the components comprising the order are completed. The tardiness minimization is the performance objective of this paper. In the problem analysis, this paper first derives some dominance properties to determine the sequence of some orders, and then analyzes problem complexities for some special cases. Three heuristic algorithms are derived with a performance bound. Moreover, three lower bounds of objective are derived and tested along with the derived properties in a branch-and-bound scheme. The overall performances of the proposed property, branch-and-bound and heuristic algorithms are evaluated via numerical experiments. Keywords: Scheduling; Order scheduling; Heuristic; Branch-and-bound (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:144:y:2013:i:1:p:128-134 DOI: 10.1016/j.ijpe.2013.01.025 Access Statistics for this article International Journal of Production Economics is currently edited by Stefan Minner More articles in International Journal of Production Economics from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.