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 12 of 12 for “"Flow-shop scheduling"”.
-
Stochastic flow shop scheduling
… we present new results for the makespan and the flowtime in a flow shop without intermediate storage between machines. We consider m machines and n jobs with random processing times. Since there is no intermediate storage between machines, a job which has finished processing at one machine may …
-
Stochastic flow shop scheduling
… new results for minimizing the makespan in a flow shop with zero storage between machines. Makespan is the total length of time required to process a set of jobs. We consider m machines and n jobs with random processing times. Since there is no intermediate storage between machines, a job that …
-
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.</p> <p>A time-indexed integer programming is proposed to identify the manufacturing schedules that minimize the electricity cost for a single factory …
-
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.</p> <p>A time-indexed integer programming is proposed to identify the manufacturing schedules that minimize the electricity cost for a single factory …
-
Hybrid flow shop scheduling with prescription constraints on jobs
… process can be modeled as a two-stage hybrid flow shop problem with specific constraints, particularly prescription constraints on the jobs. This thesis restates the practical problem as a scheduling problem by doing hypotheses and restrictions. Then, it designs a mathematical model based on …
-
A water flow algorithm for optimization problems
… natured-inspired algorithm, called the water flow algorithm (WFA), for solving optimization problems has been proposed. The algorithm is designed by simulating the hydrological cycle in meteorology and the erosion phenomenon in nature. Basic operators of this algorithm are based on the …
-
Modeling, Analysis, and Algorithmic Development of Some Scheduling and Logistics Problems Arising in Biomass Supply Chain, Hybrid Flow Shops, and Assembly Job Shops
… today's highly competitive markets. Production scheduling and design and optimization of logistics network mark the underlying topics of our work. In particular, we address three problems, Biomass Logistics Problem, Hybrid Flow Shop Scheduling Problem, and Stochastic Demand Assembly Job …
-
The scheduling of manufacturing systems using Artificial Intelligence (AI) techniques in order to find optimal/near-optimal solutions.
This thesis aims to review and analyze the scheduling problem in general and Job Shop Scheduling Problem (JSSP) in particular and the solution techniques applied to these problems. The JSSP is the most general and popular hard combinational optimization problem in manufacturing systems. For the …
-
Optimal and heuristic solutions for the single and multiple batch flow shop lot streaming problems with equal sublots
… solutions to various problems that arise in the flow-shop environments which utilize lot-streaming. Lot streaming is a commonly used process of splitting production lots into sublots and, then, of scheduling the sublots in an overlapping fashion on the machines, so as to expedite the progress of …
-
Job Sequencing & WIP level determination in a cyclic CONWIP Flowshop with Blocking
… This research assumes a 'permutational' scheduling policy and proposes an iterative approach to find the best sequence. The approach utilizes a controlled enumerative approach called the Fast Insertion Heuristic (FIH) coupled with a method to appraise the quality of every enumeration at …
-
Next-generation safety-critical systems on multi-core platforms
… assumption has been broadly accepted by classic scheduling theory for the past three decades; unfortunately, it is not even true in an approximate sense in a modern multi-core chip, and this leads to a lack of composability. Shared hardware resources like caches, main memory, and I/O buses are …