Extent:
Online-Ressource
digital
Series:
Type of publication: Book / Working Paper
Language: English
Notes:
Description based upon print version of record
Flow Shop Scheduling; Preface; Contents; Acronyms; Chapter 1 INTRODUCTION; 1.1 Assumptions and Conventions; 1.2 Terminology; 1.2.1 Problem Classification and Notation; Type and Size; Special Features; Objective Function; 1.3 Precedence; 1.3.1 Precedence versus Dominance; 1.4 The Permutation Flow Shop; 1.5 Graphic Representation of Flow Shop Schedules; 1.6 Dominance Properties; 1.6.1 Sequencing using Dominance; 1.7 Heuristics and Worst Case Analysis; 1.7.1 Cyclic Flow Shops; Cycle Time Compared to Makespan; References; Chapter 2 THE TWO-MACHINE FLOW SHOP; 2.1 Examples
Dominance PropertiesLower Bound; Heuristics; Insertion Algorithm; Computational Results; 2.8 F2|(perm)|ΣTj; 2.8.1 Dominance properties; 2.8.2 Lower Bounds; A first bound; A Tighter Bound; 2.8.3 Branch-and-Bound Algorithms; 2.8.4 Heuristics; The SPT-PI Algorithm; 2.8.5 F2|(perm), prep|ΣTj; 2.9 F2|(perm), dj = d|ΣwjUj; 2.9.1 The Complexity of F2|(perm), dj = d|ΣUj; 2.9.2 F2|(perm), (pmtn), dj = d|ΣwjUj; 2.10 F2|(perm), pij=uij - vijrij|(Σijrij |Cmax ≤ D); 2.11 Bicriteria Objectives; 2.11.1 Branch-and-Bound for a Bicriteria Objective; 2.11.2 F2|(perm)|(ΣCj, Cmax)
2.11.3 Bicriteria Involving Cmax and a Measure of TardinessDominance Properties; Lower Bounds; Heuristics; Computational Experiments; 2.12 Related Problems; 2.12.1 G2|(pmtn)|Cmax; 2.12.2 O2|(pmtn)|Cmax; 2.12.3 S2||Cmax and S2|pmtn|Cmax; 2.13 Closing Remarks; References; Chapter 3 TRANSFER LAGS IN THE FLOW SHOP; 3.1 Preliminaries; 3.1.1 Applications; 3.1.2 Types of Lags; 3.1.3 Notation; 3.2 The Two-Machine Flow Shop with Lags; 3.2.1 F2|perm, lj|Cmax; 3.2.2 When are Permutation Schedules Optimal?; 3.2.3 F2|rvrs, lj|Cmax; 3.2.4 F2|lj|Cmax; The Complexity of F2|lj|Cmax; 3-PARTITION
Lower Bounds on CmaxHeuristic Algorithms; 3.2.5 F2|(perm), prec|Cmax; F2|(perm), strings|Cmax; F2|(perm), chains|Cmax; Parallel Chains Algorithm (PCA); F2|(perm), groups|Cmax; Parallel Groups Algorithm; More General Precedence Requirements; 3.2.6 Two-Stage Manufacturing Cells as Flow Shops with Lags; Lag Algorithm; 3.3 The Two-Stage Hybrid Flow Shop with Lags; 3.3.1 Preliminaries; LBM rule; Heuristic H; 3.3.2 F(k1, k2)|perm, lj|Cmax; Heuristic HP; 3.3.3 F(k1, k2)|rvrs, lj|Cmax; Heuristic HR; 3.3.4 F(k1, k2)|lj|Cmax; Heuristic HU; 3.3.5 Summary of Performance Ratio and Complexity Results
3.3.6 Computational Experiments
2.2 F2|(perm), (pmtn)|Cmax : Johnson's Rule2.2.1 F2|(perm), rj |Cmax and F2|(perm)|Lmax; 2.2.2 F2|(perm), prec|Cmax; 2.2.3 F2|perm, sij, tij|Cmax; 2.2.4 Manufacturing Cells; 2.2.5 F2|sij |Cmax with a Single Server; 2.2.6 Lot Streaming; 2.3 The Choice of Objective; 2.4 F2|(perm)|ΣCj; 2.4.1 Polynomially Solvable Cases; 2.4.2 Lower Bounds; 2.4.3 Optimal Algorithms and Heuristics; 2.4.4 F2|(perm)|ΣCj with Setups; Dominance Properties; Lower Bounds; Heuristics and Computational Results; 2.5 F2|(perm)|(ΣCj|min Cmax); 2.6 F2|(perm)|(αΣCj+βCmax); 2.7 F2|(perm)|fmax; 2.7.1 F2|(perm), sj|Lmax or Tmax
Electronic reproduction; Available via World Wide Web
ISBN: 978-1-4614-5152-5 ; 978-1-4614-5151-8
Other identifiers:
10.1007/978-1-4614-5152-5 [DOI]
Source:
ECONIS - Online Catalogue of the ZBW
Persistent link: https://www.econbiz.de/10014275488