Normal view MARC view

Elements of sequencing and scheduling

Author: Baker, Kenneth R. Publisher: Kenneth R. Baker, 1995.Language: EnglishDescription: 275 p. : Graphs ; 28 cm.ISBN: 0936974613Type of document: BookBibliography/Index: Includes bibliographical references
Tags: No tags from this library for this title. Log in to add tags.
Item type Current location Collection Call number Status Date due Barcode Item holds
Book Asia Campus
Main Collection
Print TS157 .B35 2005
(Browse shelf)
Available 900175753
Total holds: 0

Includes bibliographical references


Elements of sequencing and scheduling TABLE OF CONTENTS 1. INTRODUCTION 1. 2. 3. Introduction to Sequencing and Scheduling Scheduling Theory Philosophy and Coverage of the Book 2. SINGLE-MACHINE SEQUENCING WITH INDEPENDENT JOBS 1. 2. 3. 4. 5. Introduction Preliminaries Problems without Due Dates: Elementary Results Problems with Due Dates: Elementary Results Summary 3. OPTIMIZATION METHODS FOR THE SINGLE-MACHINE PROBLEM 1. 2. 3. 4. 5. 6. Introduction Adjacent Pairwise Interchange Methods A Dynamic Programming Approach Dominance Properties A Branch and Bound Approach Summary 4. HEURISTIC METHODS FOR THE SINGLE-MACHINE PROBLEM 1. 2. 3. 4. 5. 6. 7. Introduction Dispatching and Construction Procedures Neighborhood Search Techniques Tabu Search Simulated Annealing Random Sampling Summary 5. EARLINESS AND TARDINESS PENALTIES Introduction Minimizing Deviations from a Common Due Date The Restricted Version Different Earliness and Tardiness Penalties Quadratic Penalties Job Dependent Penalties Distinct Due Dates Summary 6. EXTENSIONS OF THE BASIC MODEL 1. 2. 3. 4. 5. Introduction Nonsimultaneous Arrivals Dependent Jobs Sequence-DependentSetup Times Summary 7. PARALLEL-MACHINE MODELS 1. 2. 3. 4. Introduction Minimizing the Makespan Minimizing Total Flowtime Summary 8. FLOW SHOP SCHEDULING 1. 2. 3. 4. 5. 6. 7. Introduction Permutation Schedules The Two-Machine Problem Special Cases of the Three-Machine Problem Minimizing the Makespan Variations of the nz-Machine Model Summary 9. LOT STREAMING PROCEDURES FOR THE FLOW SHOP Introduction The Basic Two-Machine Model The Three-Machine Model with Consistent Sublots The Three-Machine Model with Variable Sublots The m-Machine Model with Consistent Sublots Summary SCHEDULING GROUPS OF JOBS Introduction Scheduling Job Families Scheduling with Batch Availability Scheduling with a Batch Processor Summary THE JOB SHOP PROBLEM Introduction Types of Schedules Schedule Generation The Shifting Bottleneck Procedure Summary SIMULATION MODELS FOR THE DYNAMIC JOB SHOP Introduction Model Elements Types of Dispatching Rules Reducing Mean Flowtirne Meeting Due Dates Summary

There are no comments for this item.

Log in to your account to post a comment.
Koha 18.11 - INSEAD Catalogue
Home | Contact Us | What's Koha?