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 | 9 |
GENERAL PURPOSE METHODOLOGIES | 41 |
EXTENSIONS OF THE BASIC MODEL | 79 |
Copyright | |
10 other sections not shown
Other editions - View all
Common terms and phrases
active schedules activity durations adjacent pairwise interchange Algorithm 2.2 assigned basic single-machine beta distribution branch and bound branching process branching tree calculations Chapter complete computational consider constructed cost denote dispatching rules dominance properties dominant set due date dynamic programming Exercise feasible flow shop problem Gantt chart given heuristic procedure hybrid algorithm integer programming job set job shop problem local optimum lower bound machine makespan problem matrix mean flowtime measure of performance method minimizing F node nondelay schedules Operations Research optimal schedule optimal sequence optimum partial schedule partial sequence performance measures permutation schedules PERT position in sequence precede job precedence constraints priority dispatching priority rule queue random resource sampling scheduled list scheduling decisions scheduling problems Section sequencing problems simulation single-machine problem solved stage subproblems subset suppose Table tardiness techniques Theorem tour traveling salesman problem trial solution unscheduled weighted mean WSPT