Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
From MaRDI portal
Publication:1666672
DOI10.1155/2015/826318zbMath1394.90340OpenAlexW2045408812WikidataQ59119575 ScholiaQ59119575MaRDI QIDQ1666672
Jose M. Framinan, Victor Fernandez-Viagas
Publication date: 27 August 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/826318
Related Items
Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness, The seeds of the NEH algorithm: an overview using bibliometric analysis
Cites Work
- Unnamed Item
- Single-machine scheduling with convex resource dependent processing times and deteriorating jobs
- Hybrid flowshop scheduling with machine and resource-dependent processing times
- Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
- Single machine scheduling with resource dependent release times and processing times
- Single machine group scheduling with resource dependent setup and processing times
- Reactive scheduling in the multi-mode RCPSP
- Single-machine scheduling with trade-off between number of tardy jobs and compression cost
- Single machine scheduling problem with controllable processing times and resource dependent release times
- A survey of results for sequencing problems with controllable processing times
- An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
- Skilled workforce scheduling in service centres
- An approach to optimizing software development team size
- A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
- A unified approach for scheduling with convex resource consumption functions using positional penalties
- Scheduling two agents with controllable processing times
- Solving the discrete time/resource trade-off problem in project scheduling with genetic algorithms
- A survey of variants and extensions of the resource-constrained project scheduling problem
- Minimizing total tardiness on a single machine with controllable processing times
- A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem
- A bicriterion approach to time/cost trade-offs in sequencing
- Single-machine sequencing with controllable processing times
- A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes
- Single machine scheduling subject to deadlines and resource dependent processing times
- Audit scheduling with overlapping activities and sequence-dependent setup costs
- Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
- An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups
- An exact algorithm for project scheduling with multiple modes
- A single machine scheduling problem with common due window and controllable processing times
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates
- Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
- Group scheduling with controllable setup and processing times: minimizing total weighted completion time
- The multi-mode resource-constrained project scheduling problem with generalized precedence relations
- Convex resource allocation for minimizing the makespan in a single machine with job release dates
- Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
- Minimizing the total weighted flow time in a single machine with controllable processing times
- A survey of scheduling with controllable processing times
- Single-machine scheduling with time-and-resource-dependent processing times
- Scheduling with controllable release dates and processing times: total completion time minimization
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
- Optimal due-date assignment problem with learning effect and resource-dependent processing times
- A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates
- Single machine scheduling with common due date and controllable processing times
- Parallel machine scheduling with a convex resource consumption function
- A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling
- Work assignment to and qualification of multi-skilled human resources under knowledge depreciation and company skill level targets
- Scheduling with controllable processing times and compression costs using population-based heuristics
- Scheduling of Project Networks by Job Assignment
- Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
- Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
- Local search methods for the discrete time/resource trade-off problem in project networks
- Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
- Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
- Handbook on Scheduling
- Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases
- Single machine batch scheduling with resource dependent setup and processing times
