Single machine scheduling with non-availability interval and optional job rejection
From MaRDI portal
Publication:2168742
DOI10.1007/s10878-022-00845-2zbMath1498.90094OpenAlexW4206816655MaRDI QIDQ2168742
Publication date: 26 August 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00845-2
Related Items (3)
Minimizing total weighted late work on a single-machine with non-availability intervals ⋮ 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
Cites Work
- Unnamed Item
- Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product
- A survey on offline scheduling with rejection
- Scheduling with time-changing effects and rate-modifying activities
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
- Single machine flow-time scheduling with a single breakdown
- Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
- Single machine lot scheduling with optional job-rejection
- Minmax scheduling and due-window assignment with position-dependent processing times and job rejection
- Single-machine scheduling with operator non-availability to minimize total weighted completion time
- Flowshop scheduling with learning effect and job rejection
- Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection
- 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
- Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
- Machine scheduling with an availability constraint
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Scheduling Problems with Two Competing Agents
- Single-machine batch scheduling problem with job rejection and resource dependent processing times
- Single machine just‐in‐time scheduling problems with two competing agents
This page was built for publication: Single machine scheduling with non-availability interval and optional job rejection
