Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval
From MaRDI portal
Publication:2346517
DOI10.1007/s12190-014-0820-3zbMath1317.90125OpenAlexW2053475819MaRDI QIDQ2346517
Publication date: 2 June 2015
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-014-0820-3
Related Items (2)
Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems
Cites Work
- Unnamed Item
- Parallel-machine scheduling with deteriorating jobs, rejection and a fixed non-availability interval
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
- Single-machine scheduling with convex resource dependent processing times and deteriorating jobs
- A survey on offline scheduling with rejection
- Scheduling on parallel identical machines with job-rejection and position-dependent processing times
- Single-machine total completion time scheduling with a time-dependent deterioration
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- Parallel-machine scheduling with deteriorating jobs and rejection
- Single machine scheduling with release dates and rejection
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- A concise survey of scheduling with time-dependent processing times
- Parallel-machine scheduling with non-simultaneous machine available time
- Parallel machines scheduling with deteriorating jobs and availability constraints
- Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
- Single-machine scheduling and due date assignment with rejection and position-dependent processing times
- Machine scheduling with an availability constraint
- SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS
- SCHEDULING DETERIORATING JOBS ON A SINGLE MACHINE WITH RELEASE TIMES AND REJECTION
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- NP-hard cases in scheduling deteriorating jobs on dedicated machines
- Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
This page was built for publication: Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval
