Insertion Algorithms with Justification for Solving the Resource-Constrained Project Scheduling
Journal Title: Decision Making in Manufacturing and Services - Year 2016, Vol 10, Issue 1
Abstract
The paper presents the resource-constrained project scheduling problem with the makespan minimisation criterion. To solve the problem, the authors propose insertion algorithms which generate schedules with use of forward serial and parallel decoding procedures. Schedules are improved with the use of the double justification by extremes technique (first right and then left justification). The efficiency of the procedures proposed is tested on standard test problems from the PSPLIB library.
Authors and Affiliations
Piotr Łebkowski, Marcin Klimek
Keywords
Related Articles
- EP ID EP413401
- DOI 10.7494/dmms.2016.10.1-2.31
- Views 87
- Downloads 0
On the Non-Symmetric Nash and Kalai-Smorodinsky Bargaining Solutions
Recently in some negotiation application areas the usual assumption that the negotiators are symmetric has been relaxed. In particular, weights have been introduced to the Nash Bargaining Solution to reflect the differe...
Editorial
Welcome to the premier issue of the new international journal Decision Making in Manufacturing and Services. The launching of a new journal is a unique opportunity to introduce its mission, scope, and coverage areas.
Corrigendum to ”Extended Model Formulation of the Proportional Lot-Sizing and Scheduling Problem with Lost Demand Costs”
Amendment to Decision Making in Manufacturing and Services, vol. 5 (1–2), 2011, pp. 49–56
BPMN – A Logical Model and Property Analysis
Business Process Modeling Notation has become a powerful and widely accepted visual language for modeling business processes. Despite its expressive power and high usability, a weak point of BPMN is the lack of formal se...
Optimizing Modular Machining Line Design Problem with Mixed Activation Mode of Machining Units
A modular transfer line designing problem is investigated. The problem is to find the best subset of modules (machining units) from a given set and to assign them to different stations so that technological constraints a...