Single machine scheduling with non-availability interval and optional job rejection
From MaRDI portal
Recommendations
- A single machine scheduling problem with rejection jobs and a machine non-availability interval
- Single Machine Scheduling with an Availability Constraint and Rejection
- Single-machine scheduling under the job rejection constraint
- Single machine lot scheduling with optional job-rejection
- Scheduling a single machine with job rejection and due-window assignment
- Single machine scheduling with rejection and generalized parameters
- scientific article; zbMATH DE number 5846621
- A single machine scheduling problem with release dates, rejection and an unavailable interval
- Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval
- Scheduling on single machine and identical machines with rejection
Cites work
- A survey on offline scheduling with rejection
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
- Comments on ``Proportionate flowshops with general position dependent processing times and ``Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
- Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
- Flowshop scheduling with learning effect and job rejection
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- Machine scheduling with an availability constraint
- Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
- Minmax scheduling and due-window assignment with position-dependent processing times and job rejection
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- Scheduling Problems with Two Competing Agents
- Scheduling with time-changing effects and rate-modifying activities
- Single machine flow-time scheduling with a single breakdown
- Single machine just‐in‐time scheduling problems with two competing agents
- Single machine lot scheduling with optional job-rejection
- Single-machine batch scheduling problem with job rejection and resource dependent processing times
- Single-machine scheduling with operator non-availability to minimize total weighted completion time
- Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
Cited in
(12)- Minimizing total weighted late work on a single-machine with non-availability intervals
- Single machine scheduling with small operator-non-availability periods
- A single machine scheduling problem with release dates, rejection and an unavailable interval
- A single machine scheduling problem with rejection jobs and a machine non-availability interval
- Single Machine Scheduling with an Availability Constraint and Rejection
- Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity
- Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions
- Single machine scheduling with rejection and a non-availability interval to minimize the maximum delivery completion time plus the total rejection cost
- Due-date assignment with acceptable lead-times on parallel machines
- Single machine lot scheduling with maintenance activity
- Online scheduling on a parallel-batch machine with pulse interruptions
- Single-machine lot scheduling with order rejection
This page was built for publication: Single machine scheduling with non-availability interval and optional job rejection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168742)
