Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 29 for “"Flow-shops"”.
-
Lot Streaming Schedules in Flow Shops
… for a single job in two- and three- machine flow shops. The optimal solution on s sublots can be obtained in O(s) time for the two-machine problem. We also present the first polynomial time solution for the three-machine problem. Two very good quality approximations for the discrete lot …
-
Johnson-type algorithms for m-machine flow shops
<p>The problem of scheduling a flow shop is discussed, and a general structure for paired-comparison based scheduling algorithms is identified;A special such algorithm for three machines is introduced, and the complete 3-machine adaptation of Johnson's algorithm, suggested by Burns and Rooker is …
-
Makespan Minimization in Re-entrant Permutation Flow Shops
Re-entrant permutation flow shop problems occur in practical applications such as wafer manufacturing, paint shops, mold and die processes and textile industry. A re-entrant material flow means that the production jobs need to visit at least one working station multiple times. A comprehensive …
-
Lot Streaming in Two-Stage Flow Shops and Assembly Systems
… relates to lot streaming in two-stage flow shops and assembly shops. Lot streaming refers to the process of splitting a production lot into sublots, and then, processing the sublots on different machines simultaneously in an overlapping manner. Such a strategy allows finished material …
-
Optimal lot streaming and scheduling of multiple jobs in two-machine no-wait flow shops
… these jobs simultaneously in two-machine no-wait flow shops. The objective is to minimize the production cost. A no-wait manufacturing system is a production environment in which each job must be processed from start to finish, without any interruption either on or between machines. Such …
-
A tabu search approach to JIT scheduling of flow shops that include exceptional machine routing jobs
… such as foundries are not classical random job shops since the same machine sequence is followed by most of the jobs. A natural approach to scheduling job shops of this sort is to take advantage of the similarities exhibited by the majority of the jobs. In this thesis, we extend a tabu search …
-
Modeling, Analysis, and Algorithmic Development of Some Scheduling and Logistics Problems Arising in Biomass Supply Chain, Hybrid Flow Shops, and Assembly Job Shops
… problems, Biomass Logistics Problem, Hybrid Flow Shop Scheduling Problem, and Stochastic Demand Assembly Job Scheduling Problem. The Biomass Logistics Problem is a strategic cost analysis for setup and operation of a biomass supply chain network that is aimed at the production of ethanol from …
-
A comparative simulation study of manufacturing resource planning, just-in-time and theory of constraints in VAT classified flow shops facing smooth and lumpy demand
… and control methods in an "I" classified flow shop, which is characterized by a single production path. This dissertation compares the performance of the production planning and control methods referred to in flow shops with a more complex layout, known as "V" "A" and "T" classified flow …
-
Including workers with disabilities in flow shop scheduling
… the inclusion of persons with disabilities into flow shops with the objective of minimizing the makespan. Since flow shops usually have only a few machines, we focus on the inclusion of one and two workers. We define the problem, propose mathematical models and a heuristic solution, as well as …
-
End-to-end scheduling to meet deadlines in distributed systems
… end-to-end scheduling problem is known as the flow-shop problem. We present several cases where the problem is tractable and evaluate two heuristic algorithms for the NP-hard general case. We generalize the traditional flow-shop model in two directions. First, we present two algorithms for …
-
Bottleneck Management through Strategic Sequencing in Smart Manufacturing Systems
… methods of addressing a circular non permutation flow shop sequencing problem with some additional constraints. Additionally, comparisons among the various heuristics algorithms are presented based on different sequencing criteria. The optimum sequence is provided as an input to a real-life …
-
Flow Shop Scheduling for Energy Efficient Manufacturing
… consumption. Thus, this thesis investigates the flow shop scheduling problems that reduce electricity costs under time-varying electricity rate. A time-indexed integer programming is proposed to identify the manufacturing schedules that minimize the electricity cost for a single factory with flow …
-
Flow Shop Scheduling for Energy Efficient Manufacturing
… consumption. Thus, this thesis investigates the flow shop scheduling problems that reduce electricity costs under time-varying electricity rate. A time-indexed integer programming is proposed to identify the manufacturing schedules that minimize the electricity cost for a single factory with flow …
-
The Asynchronous t-Step Approximation for Scheduling Batch Flow Systems
… a variety of tetris-like systems, such as batch flow shops for manufacturing models. Each heap in the model can be identified with a single product to manufacture. The objective is to manufacture a group of products in such an order so as to minimize the total manufacturing time. Because this …
-
Lot streaming in hybrid flow shop scheduling
… decades and is shown to accelerate production flow. This research deals with lot streaming in hybrid flow shops. Multiple products are processed in a multi-stage hybrid flow shop with non-identical machines. Sublots can be constant or consistent and intermingling is not allowed. Setups are …
-
A Stochastic model of multi-stage pull production systems
… manufacturing systems, assembly lines, and flow shops.</p>
-
An analysis tableau and algorithm for flow-shop makespan minimization
An analysis tableau suitable for investigating flow-shop attributes is presented in detail 1. Geometric properties, inherent within the tableau, are employed using graph theory concepts in developing a heuristic algorithm for makespan minimization. Computer implementation of this algorithm revealed …
Page 1 of 2