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

Computational Model of Collective Intelligence for Meta-level Analysis and Prediction of Free or Quasi-free Market Economy

This paper encourages the use of a computational model of Collective Intelligence as a major (meta-level) tool to analyze and predict behavior of socio-economical systems like free (or quasi-free) markets are. Researcher...

Corrigendum to ”Neighbourhood Properties in Some Single Processor Scheduling Problem with Variable Efficiency and Additional Resources”

Amendment to [Decision Making in Manufacturing and Services, vol. 5 (1–2), 2011, pp. 5–17

Mixed Integer Programming Approaches to Planning and Scheduling in Electronics Supply Chains

This paper discusses mixed integer programming (MIP) approaches to planning and scheduling in electronics supply chains. First, the short-term detailed scheduling of wafer fabrication in semiconductor manufacturing and d...

Models and Tools for Improving Efficiency in Constraint Logic Programming

Constraint Satisfaction Problems typically exhibit strong combinatorial explosion. In this paper we present some models and techniques aimed at improving efficiency in Constraint Logic Programming. A hypergraph model of...

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...

Download PDF file
  • EP ID EP413401
  • DOI 10.7494/dmms.2016.10.1-2.31
  • Views 91
  • Downloads 0

How To Cite

Piotr Łebkowski, Marcin Klimek (2016). Insertion Algorithms with Justification for Solving the Resource-Constrained Project Scheduling. Decision Making in Manufacturing and Services, 10(1), 31-43. https://europub.co.uk/articles/-A-413401