Single-machine batch scheduling problem with job rejection and resource dependent processing times
From MaRDI portal
Recommendations
- Single-machine scheduling under the job rejection constraint
- Single machine batch scheduling with deadlines and resource dependent processing times
- Single-machine scheduling and due date assignment with rejection and position-dependent processing times
- Batch scheduling with job processing time compatibility and rejection on a single machine
- Single machine scheduling problems with resource dependent processing times
- Single machine batch scheduling with resource dependent setup and processing times
- Single machine batch scheduling with rejection to minimize makespan
- Scheduling a single machine with job rejection and due-window assignment
- Single-machine scheduling with time-and-resource-dependent processing times
- Single machine scheduling with piecewise linear decreasing processing times and rejection jobs
Cites work
- A bicriteria approach to scheduling a single machine with job rejection and positional penalties
- A survey of results for sequencing problems with controllable processing times
- A survey of scheduling with controllable processing times
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
- scientific article; zbMATH DE number 3014822 (Why is no real title available?)
- scientific article; zbMATH DE number 871904 (Why is no real title available?)
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Scheduling with batching: A review
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
- Single machine batch scheduling to minimize total completion time and resource consumption costs
- Single machine batch scheduling with deadlines and resource dependent processing times
- Single machine batch scheduling with resource dependent setup and processing times
- Single machine scheduling with batch-dependent setup times
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
Cited in
(8)- Minimizing total late work on a single machine with generalized due-dates
- Single machine scheduling with non-availability interval and optional job rejection
- Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
- Research on resource constraint scheduling with job rejection and learning effect
- Effective league championship algorithm and lower bound procedure for scheduling a single batch-processing machine with non-identical job sizes and job rejection
- Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
- Minimizing the total weighted earliness-tardiness about a non-restrictive common due date with optional job rejection on single and multiple machines
This page was built for publication: Single-machine batch scheduling problem with job rejection and resource dependent processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4553872)