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

DOI10.1142/S0217595922500403MaRDI QIDQ6544919zbMATH OpenFDO

Authors Min Ji, Kaili Qi, T. C. Edwin Cheng, Yiwei Jiang

Publication date 28 May 2024

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0217595922500403

zbMATH Keywords

FPTASjob rejectionmachine availabilityposition-based processing timessingle machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single Machine Scheduling with an Availability Constraint and Rejection
• Single-machine scheduling and due date assignment with rejection and position-dependent processing times
• A bicriteria approach to scheduling a single machine with job rejection and positional penalties
• Scheduling on parallel identical machines with job-rejection and position-dependent processing times
• Single machine scheduling with piecewise linear decreasing processing times and rejection jobs

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

Cited in

(2)

• Study on single-machine group scheduling with convex resource allocations and different due-date assignments
• Single machine scheduling with a restricted weight-modifying activity to minimize the weighted makespan

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)