A unified approach to single-machine scheduling with position-based processing times, machine availability, and job rejection

Cites Work

Rescheduling on identical parallel machines with machine disruptions to minimize total completion time
Single-machine scheduling with effects of exponential learning and general deterioration
Order acceptance and scheduling with consideration of service level
Makespan minimization for parallel machines scheduling with multiple availability constraints
Single machine scheduling with release dates and rejection
Single-machine scheduling with learning considerations
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
Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
Flow shop scheduling jobs with position-dependent processing times
Flow-shop scheduling with a learning effect
Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect
Parallel machine scheduling with a learning effect
Multiprocessor Scheduling with Rejection
A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint
Optimality of Jackson's permutations with respect to limited machine availability
Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity
Single machine scheduling with learning effect considerations
Research on m‐machine flow shop scheduling with truncated learning effects

This page was built for publication: A unified approach to single-machine scheduling with position-based processing times, machine availability, and job rejection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6544919)