Minimizing makespan in a group shop with fuzzy release dates and processing times

2012 ◽  
Vol 66 (9-12) ◽  
pp. 2063-2074 ◽  
Author(s):  
Fardin Ahmadizar ◽  
Alireza Zarei
Keyword(s):  
Release Dates ◽  
Processing Times

scholarly journals Minimizing Total Completion Time For Preemptive Scheduling With Release Dates And Deadline Constraints

2014 ◽  
Vol 39 (1) ◽  
pp. 17-26 ◽  
Author(s):  
Cheng He ◽  
Hao Lin ◽  
Yixun Lin ◽  
Junmei Dou
Keyword(s):  
Completion Time ◽  
Total Completion Time ◽  
Release Dates ◽  
Preemptive Scheduling ◽  
Release Date ◽  
Enumeration Algorithm ◽  
Processing Times ◽  
Special Cases ◽  
Deadline Constraints ◽  
Special Case

Abstract It is known that the single machine preemptive scheduling problem of minimizing total completion time with release date and deadline constraints is NP- hard. Du and Leung solved some special cases by the generalized Baker's algorithm and the generalized Smith's algorithm in O(n2) time. In this paper we give an O(n2) algorithm for the special case where the processing times and deadlines are agreeable. Moreover, for the case where the processing times and deadlines are disagreeable, we present two properties which could enable us to reduce the range of the enumeration algorithm

Scheduling with controllable release dates and processing times: Makespan minimization

2006 ◽  
Vol 175 (2) ◽  
pp. 751-768 ◽  
Author(s):  
T.C. Edwin Cheng ◽  
Mikhail Y. Kovalyov ◽  
Natalia V. Shakhlevich
Keyword(s):  
Release Dates ◽  
Makespan Minimization ◽  
Processing Times ◽  
Controllable Release

scholarly journals Bicriterion Optimization for Flow Shop with a Learning Effect Subject to Release Dates

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Ji-Bo Wang ◽  
Jian Xu ◽  
Jing Yang
Keyword(s):  
Pareto Front ◽  
Learning Effect ◽  
Flow Shop ◽  
Search Tree ◽  
Release Dates ◽  
Processing Times ◽  
Flow Shop Problem ◽  
Speed Up ◽  
Bicriterion Optimization ◽  
Time Subject

This paper investigates a two-machine flow shop problem with release dates in which the job processing times are variable according to a learning effect. The bicriterion is to minimize the weighted sum of makespan and total completion time subject to release dates. We develop a branch-and-bound (B&B) algorithm to solve the problem by using a dominance property, several lower bounds, and an upper bound to speed up the elimination process of the search tree. We further propose a multiobjective memetic algorithm (MOMA), enhanced by an initialization strategy and a global search strategy, to obtain the Pareto front of the problem. Computational experiments are also carried out to examine the effectiveness and the efficiency of the B&B algorithm and the MOMA algorithm.

scholarly journals Resource Management in Machine Scheduling Problems: A Survey

2007 ◽  
Vol 1 (2) ◽  
pp. 59-89 ◽  
Author(s):  
Adam Janiak ◽  
Władysław Janiak ◽  
Maciej Lichtenstein
Keyword(s):  
Job Scheduling ◽  
Scientific Literature ◽  
Real Life ◽  
Release Dates ◽  
Scheduling Problems ◽  
Release Date ◽  
Processing Times ◽  
Solution Algorithms ◽  
Machine Scheduling Problems ◽  
Scheduling Models

The paper is a survey devoted to job scheduling problems with resource allocation. We present the results available in the scientific literature for commonly used models of job processing times and job release dates, i.e., the models in which the job processing time or the job release date is given as a linear or convex function dependent on the amount of the additional resource allotted to the job. The scheduling models with resource dependent processing times or resource dependent release dates extend the classical scheduling models to reflect more precisely scheduling problems that appear in real life. Thus, in this paper we present the computational complexity results and solution algorithms that have been developed for this kind of problems.

Sign in / Sign up

Export Citation Format

Share Document