Sequencing and Scheduling: An Introduction to the Mathematics of the Job-shop |
Other editions - View all
Common terms and phrases
1XXX 2XXX 4XXX active schedule Algy assumption b₁ branch and bound C₁ calculate Chapter choice Cmax complete enumeration consider constructive Daily Express depth-first search discuss due date dynamic programming elimination tree equivalent example exponential find an optimal follows frontier search Gantt diagram given Hence heuristic methods idle instance integer programming interchange J₁ J₂ Ji(k job-shop job-shop problem Johnson's Algorithm lower bound M₁ M₂ mathematical max problem maximum minimising F nodes non-delay schedule non-zero ready Note NP-complete NP-hard number of jobs operation OPT(I optimal schedule optimal sequence optimisation problem P₁ performance measure permutation schedules Pi(k polynomial polynomial time algorithm possible schedules precedence constraints processing order processing sequence proof recognition problem regular measure scheduling problems scheduling theory Section semi-active solve SPT schedule Step subset Suppose Table tardy technological constraints Theorem theory tion Tmax total cost trial schedule