Elements of Sequencing and SchedulingK.R. Baker, 1995 - Business & Economics |
Contents
HEURISTIC METHODS FOR THE SINGLEMACHINE PROBLEM | 3-24 |
Summary | 4-7 |
EARLINESS AND TARDINESS PENALTIES | 5-2 |
Copyright | |
11 other sections not shown
Common terms and phrases
adjacent pairwise interchange algorithm approach basic single-machine batch branch and bound branching process chapter combinatorial optimization Common Due Date computational effort consider construct dispatching procedures dominant set due-date dynamic programming example flow allowance follows Gantt chart global optimum Greedy greedy algorithm heuristic procedure inserted idle job completion job in sequence job sequence Johnson's Rule label Lageweg last job lower bound machine makespan problem method nondelay NP-hard number of jobs objective function Operations Research optimal makespan optimal schedule optimal sequence optimal solution optimum P(js performance measure permutation schedules position in sequence priority rules processing ratio sampling scheduling problems scheduling theory selection sequencing problem set of jobs setup simulated annealing single-machine model single-machine problem solving stage Step subproblem subsets Suppose SWPT T-problem Table tabu search tardiness penalty techniques test problems Theorem total penalty total tardiness trial solution two-machine unrestricted version zero