Single-machine scheduling with machine unavailability periods and resource dependent processing times
From MaRDI portal
Recommendations
- Single-machine scheduling with resource-dependent processing times and multiple unavailability periods
- Single machine scheduling subject to deadlines and resource dependent processing times
- Single-machine scheduling with time-and-resource-dependent processing times
- Single machine scheduling with resource dependent release times and processing times
- Single machine scheduling problems with resource dependent processing times
Cites work
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
- A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
- A survey of scheduling with controllable processing times
- A two-machine flow shop scheduling problem with controllable job processing times
- An approximation algorithm for the generalized assignment problem
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
- Bounds on Multiprocessing Timing Anomalies
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
- Discrete-variable extremum problems
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
- Group scheduling with controllable setup and processing times: minimizing total weighted completion time
- scientific article; zbMATH DE number 4035555 (Why is no real title available?)
- Improved algorithms for two single machine scheduling problems
- Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
- Machine scheduling with availability constraints
- Makespan minimization for two parallel machines with an availability constraint
- Minimizing the total weighted flow time in a single machine with controllable processing times
- Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases
- Non-preemptive two-machine open shop scheduling with non-availability constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Positive half-products and scheduling with controllable processing times
- Pre-emptive scheduling problems with controllable processing times
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors
- Scheduling Multiple Variable-Speed Machines
- Scheduling with limited machine availability
- Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
- Single machine flow-time scheduling with a single breakdown
- Single machine flow-time scheduling with scheduled maintenance
- Single machine scheduling subject to deadlines and resource dependent processing times
- Single machine scheduling with discretely controllable processing times
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- The efficiency range of economical cutting conditions and tool replacement under the age replacement strategy
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
- Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
Cited in
(11)- Target-based distributionally robust optimization for single machine scheduling
- Single-machine scheduling with resource-dependent processing times and multiple unavailability periods
- Minimizing total weighted late work on a single-machine with non-availability intervals
- Single machine scheduling with small operator-non-availability periods
- Integrated scheduling problem on a single bounded batch machine with an unavailability constraint
- Single-machine scheduling of multiple projects with controllable processing times
- Theory and methodology of time-dependent scheduling: past, present and future
- Single machine controllable scheduling with bounded makespan
- Controllable processing time scheduling with total weighted completion time objective and deteriorating jobs
- Scheduling problems on parallel dedicated machines with non-renewable resource
- Single machine scheduling with a restricted weight-modifying activity to minimize the weighted makespan
This page was built for publication: Single-machine scheduling with machine unavailability periods and resource dependent processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2242291)
