Loading...
Search for:
machine-eligibility-constraint
0.004 seconds
Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Times and Release Dates and Machines Eligibility with Minimization of Total Tardiness and Earliness
, M.Sc. Thesis Sharif University of Technology ; Salmasi, Naser (Supervisor)
Abstract
This research deals with the Unrelated Parallel Machine Scheduling (UPMS) problem with sequence dependent setup times and release dates and machines eligibility. The studied objective is the minimization of total tardiness and earliness.The due dates and release times of the jobs are distinct which complicates the problem. Two mixed linear integer programming models proposed to solve the research problem optimally in small size instances.The problem is shown to be NP-hard in the strong sense.As it is not possible to solve medium and large size instances in approporaite time, a metaheuristic algorithm based on tabu search developed. Several versions of algorithm are obtained based on...
A Two Criteria Objective Function Flexible Flowshop Scheduling Problem With Machine Eligibility Constraint
, M.Sc. Thesis Sharif University of Technology ; Salmasi, Nasser (Supervisor)
Abstract
This study strives to minimize a two-criterion objective function of a flexible flow shop scheduling problem with receipt and delivery of jobs in groups and processing them individually. Every group of jobs has a release time, which means that all jobs are not available at the beginning of the planning horizon. Moreover, due to the special characteristics of every job in a group, only a subset of machines at each stage are eligible to process that job. This problem has many applications in production and service industries, such as restaurants and ceramic tile manufacturing companies. The objective function is determined based on the practical applications of the problem. It deals with...
Solving Multi-objective Parallel Machines Scheduling Problem by Using Benders Decomposition Method
, M.Sc. Thesis Sharif University of Technology ; Eshghi, Kourosh (Supervisor)
Abstract
Parallel machine scheduling problems are the decision-making process of allocating limited resources to activities over time. These issues have attracted a lot of attention in the past decades based on their applications in the real world. It can be discussed about the application of parallel machine scheduling problems in computer processing, production lines and multi-stage systems as examples of areas where parallel machine is observed. Most of the research on parallel machine scheduling has focused on the optimization of a single criterion such as total or average task completion time, total completion time with different weights, sum of penalty or tardiness penalty, total number of...
A two-criteria objective function flexible flowshop scheduling problem with machine eligibility constraint
, Article International Journal of Advanced Manufacturing Technology ; Volume 64, Issue 5-8 , April , 2013 , Pages 1001-1015 ; 02683768 (ISSN) ; Salmasi, N ; Sharif University of Technology
2013
Abstract
This research deals with a flexible flowshop scheduling problem with the arrival and delivery of jobs in groups and processing them individually. Each group of jobs has a specific release time. Due to the special characteristics of each job, only a specific group of machines in each stage are eligible to process that job. All jobs in a group should be delivered at the same time after processing. The objectives of the problem are the minimization of the sum of the completion time of groups on one hand and the minimization of sum of the differences between the completion time of jobs and the delivery time of the group containing that job (waiting period) on the other hand. The problem can be...