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
DOI10.1080/0305215X.2019.1650922OpenAlexW2968232940MaRDI QIDQ5059405
Publication date: 23 December 2022
Published in: Engineering Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0305215x.2019.1650922
Related Items (1)
Cites Work
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
- Scheduling deteriorating jobs subject to job or machine availability constraints
- Single-machine scheduling with learning considerations
- Capacitated two-parallel machines scheduling to minimize sum of job completion times
- Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
- Complexity of scheduling tasks with time-dependent execution times
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
- Some scheduling problems with general position-dependent and time-dependent learning effects
- A state-of-the-art review on scheduling with learning effects
- Scheduling linear deteriorating jobs with an availability constraint on a single machine
- Machine scheduling with an availability constraint
- Scheduling Deteriorating Jobs on a Single Processor
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
- A note on resource allocation scheduling with position-dependent workloads
- Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint
- Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs
- Single machine scheduling with learning effect considerations
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
