A hybrid GRASP algorithm for minimizing total weighted resource tardiness penalty costs in scheduling of project networks

author

Abstract:

In this paper, we consider scheduling of project networks under minimization of total weighted resource tardiness penalty costs. In this problem, we assume constrained resources are renewable and limited to very costly machines and tools which are also used in other projects and are not accessible in all periods of time of a project. In other words, there is a dictated ready date as well as a due date for each resource such that no resource can be available before its ready date but the resources are allowed to be used after their due dates by paying penalty cost depending on the resource type. We also assume, there is only one unit of each resource type available and no activity needs more than it for execution. The goal is to find a schedule with minimal total weighted resource tardiness penalty costs. For this purpose, we present a hybrid metaheuristic procedure based on the greedy randomized adaptive search algorithm and path-relinking algorithm. We develop reactive and non-reactive versions of the algorithm. Also, we use different bias probability functions to make our solution procedure more efficient. The computational experiments show the reactive version of the algorithm outperforms the non-reactive version. Moreover, the bias probability functions defined based on the duration and precedence relation characteristics give better results than other bias probability functions.

Download for Free

Sign up for free to access the full text

Already have an account?login

similar resources

a hybrid grasp algorithm for minimizing total weighted resource tardiness penalty costs in scheduling of project networks

in this paper, we consider scheduling of project networks under minimization of total weighted resource tardiness penalty costs. in this problem, we assume constrained resources are renewable and limited to very costly machines and tools which are also used in other projects and are not accessible in all periods of time of a project. in other words, there is a dictated ready date as well as a d...

full text

A Hybrid GRASP Algorithm for Minimizing Total Weighted Resource Tardiness Penalty Costs in Scheduling of Project Networks

KEYWORDS In this paper, we consider scheduling of project networks under minimization of total weighted resource tardiness penalty costs. In this problem, we assume constrained resources are renewable and limited to very costly machines and tools which are also used in other projects and are not accessible in all periods of time of a project. In other words, there is a dictated ready date as we...

full text

Minimizing weighted total earliness, total tardiness and setup costs

A single machine scheduling problem is described which covers earliness costs, tardiness costs and setup costs. Setups are needed whenever a switch is made to a job of another product family. All jobs within the same product family have the same processing time. Besides setup costs also setup times are involved. Idle time is allowed, preemption is not allowed. Both a mixed integer programming f...

full text

Fuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm

Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. One type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for...

full text

Fuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flowtime through Genetic Algorithm

Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters with it, this is why in recent decades extensive researches have been done on scheduling issues. A type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical ...

full text

Minimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem

  This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date. The drop dead date is the date in which jobs’ weights rise sharply or the customer cancels the order. A linear programming formulation is developed for the problem and since the problem is known to be NP-hard, three heuristic...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 23  issue 3

pages  231- 243

publication date 2012-09

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023