Decomposition Methods for Complex Factory Scheduling Problems

Name: Decomposition Methods for Complex Factory Scheduling Problems
Brand: Springer Nature
SKU: 9780792398356
Availability: InStock

Best Price (Coupon Required):
Buy Decomposition Methods for Complex Factory Scheduling Problems for $76.50 at @ Link.springer.com when you apply the 10% OFF coupon at checkout.
Click “Get Coupon & Buy” to copy the code and unlock the deal.

Set a price drop alert to never miss an offer.

1 Offer Price Range: $84.99 - $84.99

BEST PRICE

Single Product Purchase

$76.50

@ Link.springer.com with extra coupon

Price Comparison

Seller	Contact Seller	List Price	On Sale	Shipping	Best Promo	Final Price	Volume Discount	Financing	Availability	Seller's Page
BEST PRICE 1 Product Purchase @ Link.springer.com		$84.99	$84.99		10% OFF This deals requires coupon	$76.50		See Site	In stock	Visit Store

Product Details

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9780792398356

Condition

New

Product Description

The factory scheduling problem, that of allocating machines to competing jobs in manufacturing facilities to optimize or at least improve system performance, is encountered in many different manufacturing environments. Given the competitive pressures faced by many companies in today's rapidly changing global markets, improved factory scheduling should contribute to a flrm's success. However, even though an extensive body of research on scheduling models has been in existence for at least the last three decades, most of the techniques currently in use in industry are relatively simplistic, and have not made use of this body of knowledge. In this book we describe a systematic, long-term research effort aimed at developing effective scheduling algorithms for complex manufacturing facilities. We focus on a speciflc industrial context, that of semiconductor manufacturing, and try to combine knowledge of the physical production system with the methods and results of scheduling research to develop effective approximate solution procedures for these problems. The class of methods we suggest, decomposition methods, constitute a broad family of heuristic approaches to large, NP-hard scheduling problems which can be applied in other environments in addition to those studied in this book.

Available Colors

N/A

Available Sizes

N/A