Introduction to sequencing and scheduling |
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
SINGLEMACHINE SEQUENCING WITH | 9 |
GENERAL PURPOSE METHODOLOGIES | 41 |
EXTENSIONS OF THE BASIC MODEL | 79 |
Copyright | |
9 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 combinatorial optimization complete computational consider constructed cost critical path denote dispatching procedure 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 lower bound machine makespan problem matrix mean flowtime measure of performance method minimum 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 scheduling decisions scheduling problems Section sequencing problems simulation single-machine problem solved stage subproblems subset suppose Table tardiness techniques Theorem traveling salesman problem trial solution unscheduled weighted mean WSPT
Bibliographic information
| Title | Introduction to sequencing and scheduling |
| Author | Kenneth R. Baker |
| Edition | illustrated |
| Publisher | Wiley, 1974 |
| Original from | the University of Michigan |
| Digitized | Dec 17, 2007 |
| ISBN | 0471045551, 9780471045557 |
| Length | 305 pages |
| Subjects | › Business & Economics / Management Business & Economics / Operations Research Production scheduling |
| Export Citation | BiBTeX EndNote RefMan |