Heuristic Scheduling Systems: With Applications to Production Systems and Project Management, Tom 3John Wiley & Sons, 10 wrz 1993 - 695 Reflects exact and heuristic methods of scheduling techniques suitable for creating customized sequencing and scheduling systems for flexible manufacturing, project management, group and cellular manufacturing operations. Summarizes complex computational studies demonstrating how they work in practice. Contains new theories and techniques developed by the author. Includes a software disk to reinforce and practice the methods described. |
Spis treści
PARTI PRELIMINARIES | 3 |
Approaches to Scheduling | 20 |
Book Summary | 36 |
OTHER ISSUES | 43 |
ONEMACHINE PROBLEMS | 45 |
20 | 56 |
Classic | 75 |
4 Dynamic Programming | 88 |
Other Objectives | 324 |
137 | 342 |
Basic Methods | 359 |
Heuristic Testing | 386 |
PROJECT SCHEDULING AND MANAGEMENT | 423 |
ResourceConstrained Project Scheduling | 463 |
Complex Resources andor Complex Activities | 507 |
Model Extensions | 532 |
New Directions | 102 |
Sequencing | 137 |
3 Nonregular Static Problems | 146 |
7 Related Probabilistic Results | 169 |
MULTIMACHINE PROBLEMS | 201 |
Bottleneck Approaches | 216 |
Parallel MachinesBatch Machines | 241 |
Shop Routing | 267 |
FLOW SHOPS AND JOB SHOPS | 295 |
Planning Scheduling and Control | 554 |
| 591 | |
| 620 | |
Appendix B Glossaries | 635 |
Getting Started with the Parsifal Software | 641 |
Parsifal Software User Guide | 646 |
| 687 | |
Kluczowe wyrazy i wyrażenia
activity aggregate algorithm approximate assigned average batch beam search bottleneck dynamics branch-and-bound busy period Chapter choose classic job completion consider Conwip cost critical path developed discuss dispatch heuristics due date duration dynamic arrivals dynamic programming economic makespan embedded problem example finish flow shop flow shops flowtime formulation furnace Gantt chart genetic algorithms given input inserted idleness integer programming job arrivals lead time iteration linear programming load lower bound LP relaxation makespan problem minimize myopic dispatch neighborhood search node Numerical Exercises objective function one-machine problem operation OPT-like optimal solution pairwise interchange parallel machines permutation sequence pilgers precedence constraints preemptive processing Proposition queue reentrant relaxation resource prices resource usage routing rule scheduling Section setup shifting bottleneck simulated annealing slack Software/Computer Exercises solve static Step subproblems tabu search tardy jobs tested tion weighted flow weighted tardiness WSPT
Popularne fragmenty
Strona 620 - International Journal of Production Research, Vol. 26, pp. 1-18. [25] Sarker, BR and Fitzsimmons, JA (1989) "The Performance of Push and Pull Systems: A Simulation and Comparative Study", International Journal of Production Research, Vol.