A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint
From MaRDI portal
Publication:5059405
Recommendations
- Single machine scheduling problems with general learning effect
- Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- Scheduling problems with learning effect and availability constraint
- Single-machine scheduling with learning considerations
Cites work
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
- A note on resource allocation scheduling with position-dependent workloads
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- A state-of-the-art review on scheduling with learning effects
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
- Capacitated two-parallel machines scheduling to minimize sum of job completion times
- Complexity of scheduling tasks with time-dependent execution times
- Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs
- Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint
- Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
- Machine scheduling with an availability constraint
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling deteriorating jobs subject to job or machine availability constraints
- Scheduling linear deteriorating jobs with an availability constraint on a single machine
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
- Single machine scheduling with learning effect considerations
- Single-machine scheduling with learning considerations
- Some scheduling problems with general position-dependent and time-dependent learning effects
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines
Cited in
(7)- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- Machine scheduling with job rejection and Dejong's learning effect
- A unified approach to single-machine scheduling with position-based processing times, machine availability, and job rejection
- Study on single-machine group scheduling with convex resource allocations and different due-date assignments
- Single-machine scheduling with a deteriorating maintenance activity and DeJong's learning effect
- Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints
- Exploring the development trajectory of single-machine production scheduling
This page was built for publication: A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5059405)
