Production Planning and Industrial Scheduling : Examples, Case Studies and Applications, Second Edition (Paperback, 2 ed)

Introduction to Production Planning and SchedulingProduction PlanningSchedulingWhat is not includedPlant Locations and Capacity DeterminationExisting Production FacilitiesNew Plant LocationsUncertainty in DemandForecasting and Aggregate PlanningForecastingAggregate PlanningMaster Pproduction Scheduling and Material Requirement PlanningMaster Production ScheduleMaterial Requirement Planning and Other TechniquesInventory and Capacity PlanningInventory PlanningSafety Stock DeterminationQuantity DiscountsSingle Period PlanningConsumption during ProductionJIT Inventory SystemRecourse Center Capacity PlanningTheory of ConstraintsA Single Machine SchedulingThe Tardiness ProblemA Survey of Exact Methods for Single Machine Scheduling ProblemCommonly Used Heuristic RulesDescription of an Efficient HeuristicA Single Machine Problem with Early and Late PenaltiesSome Well-Known TheoremsOther Objectives in Single-Machine SchedulingCommon Due DateCommon Due Date Specified by a CustomerEarly and Late Due DatesQuadratic or Nonlinear Penalty FunctionMinimization of the Average DelayMinimization of the Maximum DelayMinimize the Number of Jobs that are DelayedIllustrative ExampleMaximize the Number of Jobs Processed when the Available Time is Less than Total Processing TimeSequence-Dependent JobsSequence-Dependent Jobs with Minimum/MaximumSeparationsMinimize Variation of Flow TimeSequence-Dependent Setup TimesDual CriteriaDelay of Early Completing JobsJobs Arriving at Different TimesFlowshop ProblemsTwo-Machine ProblemThree-Machine ProblemSetup/Processing and Removal Times Separated: Another Extension of Johnson's AlgorithmTwo-Machine Flowshop with Travel time Between Machinesn Jobs/m-Machines Problemn-Job/m-Machine Problem: Jobs Arriving at Different TimesExampleResultParallel Processing and Batch SequencingParallel ProcessingSingle Operation Job Related Earliness/Tardiness Penalties WithMachine Activation CostNonidentical Parallel ProcessorsParallel Machines in a FlowshopBatch Scheduling for a Limited-Capacity Fixed-Period ProcessProblemBatch Scheduling for Limited-Capacity Processors, in Sequence with Varying Job RequirementsBatch SequencingNetwork-Based SchedulingCritical Path MethodTo Schedule a Network of Jobs on a Specified Number of Parallel ProcessorsScheduling n Jobs on m Parallel Machines when Each Job Can be Scheduled on p Machines, p" Being a Subset of m, that is, p = mAssembly Line BalancingMixed Model Assembly Line BalancingMixed-Model Assembly-Method to Minimize StationsNetwork Scheduling with Resource ConstraintJob Shop SchedulingJob ShopJob Shop Scheduling to Minimize Makespan (SPT)Network Approach to Job Shop SchedulingJob Shop Scheduling to Minimize TardinessOpen-Shop SchedulingMinimize Makespan: Two-Machine ProblemMinimize Makespan: Multiple-Machine ProblemMinimization of Total Tardiness-Open Shop (MTT-OP)Minimization of Total Weighted Tardiness Penalties-Open Shop(MTWT-OP)Manpower SchedulingConsecutive Days-off SchedulingRotating days (Weekends) offMonroe's AlgorithmTour SchedulingThree Consecutive Days OffIndustrial Sequencing I: Scheduling on NC MachinesTabular Approach in Group FormingJob Sequencing to Minimize Tool Changeovers in FlexibleManufacturing SystemsHeuristic to Minimize Throughput Time on an NC MachineProblem Definition and AssumptionsIndustrial Sequencing II: Electronic Assemblies:ComponentTape Assemblies on a SequencerA Heuristic Procedure for Tape Assembling on a SequencerIndustrial Sequencing III: Sequencing Feeder forComponentTape AssemblyProblem DescriptionHeuristic ProcedureIndustrialScheduling IV: Scheduling in Flexible ManufacturingA CDS-Based Two-Phase Algorithm for Group Scheduling withMultiple Robots in Assembly OperationsAPPENDIX: Computer Program DescriptionINDEXEach Chapter includes a summary and bibliography