Resource Management in Machine Scheduling Problems: A Survey
Journal Title: Decision Making in Manufacturing and Services - Year 2007, Vol 1, Issue 1
Abstract
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.
Authors and Affiliations
Adam Janiak, Maciej Lichtenstein, Władysław Janiak
Keywords
Related Articles
- EP ID EP422732
- DOI 10.7494/dmms.2007.1.2.59
- Views 88
- Downloads 0
Application of Fuzzy Based VIKOR Approach for Multi-Attribute Group Decision Making (MAGDM): A Case Study in Supplier Selection
In today’s competitive global markets, selection of a potential supplier plays an important role to cut production costs as well as material costs of the company. This leads to successful survival and sustainability in a...
Batch Scheduling of Deteriorating Products
In this paper we consider the problem of scheduling N jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a simple linear increasing function depending on job’s waitin...
A multi-criteria optimization approach to modeling negotiation process
The paper presents a multi-criteria optimization approach to modeling negotiation process. The negotiation process is modeled as a special multi-criteria problem. The method for finding solutions is the interactive selec...
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
Scheduling of Identical Jobs with Bipartite Incompatibility Graphs on Uniform Machines. Computational Experiments
In the paper we consider the problem of scheduling of unit-length jobs on 3 or 4 uniform parallel machines to minimize schedule length or total completion time. We assume that jobs are subject to some kind of mutual excl...