Single Machine Scheduling
Simulated Annealing Algorithm to Minimize Makespanin Single Machine Scheduling Problem withUniform Parallel Machines
... machines scheduling problem, consider the machine shop of an automobile ...independent single operation jobs are scheduled on these two categories of machines collec- tively to minimize the makespan, ...
10
Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines
... Production scheduling paves ways for effective calendar of production for day to day requirements in ...The single machine scheduling problem with unrelated parallel machines which is ...
11
On Possible and Necessary Optimality of Schedules in the Single Machine Scheduling Problem with Imprecise Processing Times and Due Dates
... controllable machine speeds. Chanas and Kasperski [3] have considered a single machine scheduling problem with fuzzy processing times and fuzzy due dates and showed that the Lawler’s algorithm ...
5
Fuzzy Programming Approach for a Multi-objective Single Machine Scheduling Problem with Stochastic Processing Time
... a single machine scheduling problem minimizing the total weighted flow time and total weighted ...a single machine scheduling ...bi-criteria single machine ...
5
Multi-criteria sequence-dependent single machine scheduling using genetic and simulated annealing algorithms
... the single machine scheduling problem with setup ...the single machine scheduling problem with sequence-dependent setup times, with the objective to minimize makespan, total ...
6
GA Based Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Uniform Parallel Machines
... the single machine scheduling problem with uniform parallel machines in which the objective is to minimize the ...viz. single point crossover method and two point crossover method, and job ...
11
Efficient Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Unrelated Parallel Machines
... machines to minimize the makespan. Since, this problem is NP-hard, any attempt to obtain the optimal solution through exact algorithm may end with failure for most of the instances. This is because of exponential ...
11
Branch and Bound Algorithm for the Single Machine Scheduling Problem with Release and Delivery times
... The single machine scheduling problem is one of the classic NP-hard optimization problems, and it is useful in solving flowshop and jobshop scheduling ...the scheduling problem, where ...
11
Single Machine Slack Due Window Assignment and Scheduling of Linear Time Dependent Deteriorating Jobs and a Deteriorating Maintenance Activity
... classical scheduling theory, job processing times are considered as ...solving scheduling problems with changeable job processing times has been witnessed in the last ...The single machine ...
9
Online Full Text
... In this work, we develop a novel analysis technique to de- rive the competitive ratio of the online algorithm based on the idea of instance transformation. In order to de- rive an upper bound on the performance ratio ...
6
Scheduling Problem with Human Energy Recovery Function under Nonlinear Time-dependent Deterioration
... consider single machine scheduling with a rate-modifying activity for a problem commonly found in electronic assembly ...suggest single machine SLK due date assignment scheduling ...
7
Deep Cutting Plane Inequalities for Stochastic Non Preemptive Single Machine Scheduling Problem
... this single machine scheduling problem, in order to test the efficiency of our inequi- ties, we compare the computational time from solving the original model without any inequalities added, with all ...
8
Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines
... Friesen and Langston [7] examined the non-preemp- tive assignment of n independent tasks to a system of m uniform processors with the objective of reducing the makespan. It is known that LPT (longest processing time ...
18
Hybrid Algorithm for Optimization Problems Applied to Single Machine Scheduling
... In the recent years, the meta-heuristics become very important and have received significant attention for solving optimization problems because they can give near solutions to combinatorial problems in reasonable time ...
5
Single Machine Scheduling with Time Dependent Learning Effect and Non Linear Past Sequence Dependent Setup Times
... addressing single machine scheduling problems, the actual processing time of a job is assumed to be a function of the sum of the normal processing times of the jobs already scheduled and the setup ...
6
Mathematical programming approach to multidimensional mechanism design for single machine scheduling
... list scheduling algorithm known as Smith’s rule [14], i.e. scheduling jobs in order of non-increasing ratio of weight over pro- cessing time w j /p j ...standard single machine ...
53
Solving Single Machine Total Weighted Tardiness Problem using Variable Structure Learning Automata
... In this paper, a new scheduling method called VSLA- Scheduler using variable structure automata technique is proposed. To evaluate performance of the proposed method, problems and data sets available in OR library ...
6
Combined objective optimization in Identical Parallel Machine Scheduling problem using PSO
... The study aims to analyze the performance of all the developed intelligent search techniques to minimize makespan and number of tardy jobs simultaneously using COF for the identical parallel processor scheduling ...
5
A Particle Swarm Optimization to Minimize Makespan for a Four Stage Multiprocessor Open Shop with Dynamic Job Release Time
... ing machine scheduling problem as a mixed integer programming model to specify the problem and to obtain optimal solutions as benchmarks, furthermore, we propose a PSO ...
6
Two Stage Flow Shop Scheduling Model Including Transportation Time with Equipotential Machines at Every Stage
... Abstract: This study presents a solution algorithm for the problem of minimizing the makespan on equipotential parallel machines at every stage in two stage flow shop scheduling model. The processing time of all ...
5