Minimizing earliness and tardiness penalties in a single-machine problem with a common due date [An article from: European Journal of Operational Research]

by C.M. Hino, D.P. Ronconi, A.B. Mendes

List Price:	~~$7.95~~
Amazon Price:	$7.95 & eligible for FREE Super Saver Shipping on orders over $25.
Lowest New Price:	$7.95
Availablitiy:	Available for download now

Editorial Reviews
Product Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2005. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
Scheduling problems involving both earliness and tardiness costs have received significant attention in recent years. This type of problem became important with the advent of the just-in-time (JIT) concept, where early or tardy deliveries are highly discouraged. In this paper we examine the single-machine scheduling problem with a common due date. Performance is measured by the minimization of the sum of earliness and tardiness penalties of the jobs. Since this problem is NP-hard, we propose a tabu search-based heuristic and a genetic algorithm which exploit specific properties of the optimal solution. Hybrid strategies are also analyzed to improve the performance of these methods. The proposed approaches are examined through a computational comparative study with 280 benchmark problems with up to 1000 jobs.

Price is accurate as of the date/time indicated. Prices and product availability are subject to change. Any price displayed on the Amazon website at the time of purchase will govern the sale of this product.