Synopses & Reviews
Synopsis
Excerpt from Planning and Scheduling for Epitaxial Wafer Production Facilities
Review OF the literature The single machine scheduling problem is perhaps the simplest of the sequen cing problems and is discussed in detail in Baker (1974) and Conway gt 91.
It is shown that for the static case with all jobs available initially, sequencingaccording to the shortest processing time minimizes the average flow time. Like wise. Sequencing ih order of due dates minimizes the maximum lateness. While simple rules are available for some objectives, no efficient algorithm exists for minimizing the average tardiness. In fact this is still an open problem since it has not been shown to be np-complete. Optimal solutions can be obtained by using dynamic programming or branch and bound techniques and a number of heuristics have been proposed for generating good schedules.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.