Premium
Sequencing with setup time and order tardiness trade‐offs
Author(s) -
Liao ChingJong,
Chuang ChengHsing
Publication year - 1996
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/(sici)1520-6750(199610)43:7<971::aid-nav3>3.0.co;2-a
Subject(s) - tardiness , changeover , computer science , schedule , due date , mathematical optimization , scheduling (production processes) , operations research , order (exchange) , retard , measure (data warehouse) , build to order , context (archaeology) , set (abstract data type) , job shop scheduling , mathematics , production (economics) , economics , database , psychology , telecommunications , paleontology , finance , transmission (telecommunications) , psychiatry , biology , macroeconomics , programming language , operating system
We consider the problem of scheduling customer orders on a single facility where each order consists of several jobs that can be clustered into several groups. When a facility is changed over to another group, a setup time associated with the new group is required. Two particular problems are considered in this context. One is to consider the total setup time and the number of tardy orders jointly. The other is to consider the total setup time and the maximum tardiness jointly. The total setup time in both problems represents a measure of internal efficiency, whereas the number of tardy orders and the maximum tardiness represent a measure of external efficiency. In any shop, the decision maker must consider the tradeoffs between large setup costs associated with a more frequent changeover schedule versus the cost of tardy orders that might be induced by a less‐frequent changeover schedule. In this article branch‐and‐bound algorithms are proposed to identify the set of nondominated schedules for the two bicriteria problems. © 1996 John Wiley & Sons, Inc.