Finding Pareto optima for maximum tardiness, maximum earliness and number of tardy jobs

Ghasem Moslehi and Majid Rohani

International Journal of Operational Research, 2012, vol. 14, issue 4, 433-452

Abstract: Just-in-time JIT (Just In Time) is an important procedure in scheduling problems which aims at minimizing minimising both earliness and tardiness at the same time. In this case, the problem is a multi-objective scheduling problem. A candidate solution method for this type of problem is finding the Pareto-optima. The present research investigates the single-machine scheduling problem in which the three objects: number of tardy job, maximum earliness, and maximum tardiness must be minimized minimised (1||ΣU_j,E_max,T_max). The branch and bound approach is proposed to find the Pareto- optima. A number of new dominance properties, upper bound, and lower bound rules are developed that help the branch and bound procedure to perform more efficiently. We generate 700 random problems to test our approach. Computational results are reported, for instances, of up to 30 jobs in size.

Keywords: tardy jobs; maximum earliness; maximum tardiness; Pareto optima; branch and bound; just-in-time; JIT; multi-objective scheduling; single-machine scheduling. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=47514 (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:14:y:2012:i:4:p:433-452

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 ().