Single machine scheduling with piecewise linear decreasing processing times and rejection jobs

DOI10.11721/CQNUJ20160207MaRDI QIDQ2823722zbMATH OpenFDO

Authors Min Sui, Chuanli Zhao

Publication date 6 October 2016

Published in Journal of Chongqing Normal University. Natural Science (Search for Journal in Brave)

zbMATH Keywords

single machine schedulingrejectionfully polynominal time approximation schemepiecewise linear decreasing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling linear deteriorating jobs with rejection on a single machine
• Scheduling jobs with piecewise linear decreasing processing times
• Single-machine scheduling under the job rejection constraint
• Single machine scheduling with release dates and rejection
• An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan

Cited in

(3)

• An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
• Single-machine batch scheduling problem with job rejection and resource dependent processing times
• A unified approach to single-machine scheduling with position-based processing times, machine availability, and job rejection

This page was built for publication: Single machine scheduling with piecewise linear decreasing processing times and rejection jobs

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