Single machine scheduling subject to deadlines and resource dependent processing times
From MaRDI portal
Publication:1278308
DOI10.1016/0377-2217(96)00129-4zbMath0947.90584OpenAlexW2020006381MaRDI QIDQ1278308
Mikhail Y. Kovalyov, Adam Janiak
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(96)00129-4
Related Items
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, Single machine batch scheduling to minimize total completion time and resource consumption costs, Bicriteria robotic cell scheduling, A survey of scheduling with controllable processing times, Batch scheduling of identical jobs with controllable processing times, Inverse interval scheduling via reduction on a single machine, Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations, Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources, Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity, Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost, Single machine scheduling problem with controllable processing times and resource dependent release times, Pre-emptive scheduling problems with controllable processing times, Min‐sum controllable risk problems with concave risk functions of the same value range, Two‐agent scheduling with linear resource‐dependent processing times, Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect, Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey, Scheduling a batching machine with convex resource consumption functions, A concise survey of scheduling with time-dependent processing times, Scheduling with controllable release dates and processing times: Makespan minimization, 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, Scheduling with due date assignment under special conditions on job processing, Single machine batch scheduling with jointly compressible setup and processing times., Single-machine group scheduling with deteriorating jobs and allotted resource, Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach, Scheduling parallel dedicated machines with the speeding‐up resource, Single-machine scheduling with machine unavailability periods and resource dependent processing times, A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine, Resource cost aware scheduling, SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE, Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches, A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates, Single machine scheduling with resource dependent release times and processing times, Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity, Just-in-time scheduling with controllable processing times on parallel machines, Parallel machine scheduling with a convex resource consumption function, Single machine group scheduling with resource dependent setup and processing times, A unified approach for scheduling with convex resource consumption functions using positional penalties, Scheduling two agents with controllable processing times, Group scheduling with controllable setup and processing times: minimizing total weighted completion time, Single machine batch scheduling with resource dependent setup and processing times, Optimal due date assignment and resource allocation in a group technology scheduling environment, A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting, Minimizing total tardiness on a single machine with controllable processing times, Min-max controllable risk problems, Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times, SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION, Multicriteria scheduling
Cites Work
- Single machine scheduling problem with a common deadline and resource dependent release dates
- Improving the complexities of approximation algorithms for optimization problems
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
