Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
type: Item
instance of: scholarly article
title: Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
zbMATH Open document ID: 1394.90340
DOI: 10.1155/2015/826318
author: Victor Fernandez-Viagas
author: Jose M. Framinan
published in: Mathematical Problems in Engineering
publication date: 2018-08-27T00:00:00Z
review text: Summary: The amount of resources assigned to a task highly influences its processing time. Traditionally, different functions have been used in the literature in order to map the processing time of the task with the amount of resources assigned to the task. Obviously, this relation depends on several factors such as the type of resource and/or decision problem under study. Although in the literature there are hundreds of papers using these relations in their models or methods, most of them do not justify the motivation for choosing a specific relation over another one. In some cases, even wrong justifications are given and, hence, infeasible or nonappropriated relations have been applied for the different problems, as we will show in this paper. Thus, our paper intends to fill this gap establishing the conditions where each relation can be applied by analysing the relations between the processing time of a task and the amount of resources assigned to that task commonly employed in the production and project management literature.
Mathematics Subject Classification ID: 90B50
zbMATH DE Number: 6927325
Wikidata QID: Q59119575
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2015/826318
OpenAlex ID: W2045408812
cites work: A unified approach for scheduling with convex resource consumption functions using positional penalties
cites work: A survey of results for sequencing problems with controllable processing times
cites work: Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
cites work: Scheduling of Project Networks by Job Assignment
cites work: Audit scheduling with overlapping activities and sequence-dependent setup costs
cites work: Work assignment to and qualification of multi-skilled human resources under knowledge depreciation and company skill level targets
cites work: Skilled workforce scheduling in service centres
cites work: Handbook on Scheduling
cites work: Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study
cites work: A survey of scheduling with controllable processing times
cites work: An approach to optimizing software development team size
cites work: Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
cites work: Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases
cites work: A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
cites work: Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
cites work: The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
cites work: Minimizing the total weighted flow time in a single machine with controllable processing times
cites work: A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates
cites work: A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
cites work: Parallel machine scheduling with a convex resource consumption function
cites work: Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
cites work: Optimal due-date assignment problem with learning effect and resource-dependent processing times
cites work: Convex resource allocation for minimizing the makespan in a single machine with job release dates
cites work: Single-machine scheduling with convex resource dependent processing times and deteriorating jobs
cites work: Reactive scheduling in the multi-mode RCPSP
cites work: A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem
cites work: The multi-mode resource-constrained project scheduling problem with generalized precedence relations
cites work: Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
cites work: Solving the discrete time/resource trade-off problem in project scheduling with genetic algorithms
cites work: An exact algorithm for project scheduling with multiple modes
cites work: Local search methods for the discrete time/resource trade-off problem in project networks
cites work: A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling
cites work: Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
cites work: An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
cites work: A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes
cites work: Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
cites work: Single machine scheduling subject to deadlines and resource dependent processing times
cites work: Group scheduling with controllable setup and processing times: minimizing total weighted completion time
cites work: Single-machine scheduling with time-and-resource-dependent processing times
cites work: Minimizing total tardiness on a single machine with controllable processing times
cites work: Scheduling with controllable release dates and processing times: total completion time minimization
cites work: A bicriterion approach to time/cost trade-offs in sequencing
cites work: Single machine scheduling problem with controllable processing times and resource dependent release times
cites work: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
cites work: Single-machine sequencing with controllable processing times
cites work: A single machine scheduling problem with common due window and controllable processing times
cites work: Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
cites work: Single machine scheduling with resource dependent release times and processing times
cites work: An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups
cites work: Single-machine scheduling with trade-off between number of tardy jobs and compression cost
cites work: Single machine scheduling with common due date and controllable processing times
cites work: Scheduling with controllable processing times and compression costs using population-based heuristics
cites work: Scheduling two agents with controllable processing times
cites work: Hybrid flowshop scheduling with machine and resource-dependent processing times
cites work: Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
cites work: Single machine batch scheduling with resource dependent setup and processing times
cites work: Heuristics for hybrid flow shops with controllable processing times and assignable due dates
cites work: Single machine group scheduling with resource dependent setup and processing times
cites work: A survey of variants and extensions of the resource-constrained project scheduling problem
cites work: Q5630793
description: scientific article; zbMATH DE number 6927325