Introduction to Sequencing and SchedulingSingle-machine sequencing with independent jobs; General purpose methodologies for the single-machine problem; Extension of the basic model; Parallel machine models; Flow shop scheduling; Job shop scheduling; Simulation studies of the dynamic job shop; Network methods for project scheduling; Resource constrained project scheduling. |
Contents
SINGLEMACHINE SEQUENCING WITH | 16 |
GENERAL PURPOSE METHODOLOGIES | 38 |
EXTENSIONS OF THE BASIC MODEL | 79 |
Copyright | |
10 other sections not shown
Other editions - View all
Common terms and phrases
activity addition algorithm appear applied approach assigned associated basic begin branch and bound calculations Chapter Compare complete computational consider constraints constructed contains corresponding cost decision delay denote described determined developed discussed dispatching distribution dominance due date duration effective elements employed examined example Exercise feasible Figure flow flowtime formulation function given illustrate initial integer interchange involves late length lower bound machine makespan mean measure method minimizing node obtained operation optimal sequence optimum original partial schedule particular path performance permutation PERT position possible precedence priority problem procedure processing produce Property random relation remaining represents Research resource rule sampling schedule selection sequence shown single-machine situations solution solved stage Step structure subproblems subset suppose Table tardiness techniques Theorem tour tree