Single-machine scheduling to minimize total weighted late work with positional due-indices

DOI10.15960/J.CNKI.ISSN.1007-6093.2020.02.010MaRDI QIDQ5143971zbMATH OpenFDO

Authors Rubing Chen, Jinjiang Yuan

Publication date 14 January 2021

Full work available at URL https://doi.org/10.15960/J.CNKI.ISSN.1007-6093.2020.02.010

zbMATH Keywords

NP-hardpositional due-indicessingle-machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Single-machine scheduling with positional due indices and positional deadlines
• Single-machine scheduling with deadlines to minimize the total weighted late work
• Single Machine Scheduling to Minimize Total Weighted Late Work
• Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
• Single Machine Scheduling to Minimize Total Late Work

Cited in

(4)

• Single-machine scheduling with positional due indices and positional deadlines
• Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
• Single-machine scheduling with deadlines to minimize the total weighted late work
• Single-machine scheduling with positional deadlines, time deadlines, and due date assignment for minimizing total weighted tardiness

This page was built for publication: Single-machine scheduling to minimize total weighted late work with positional due-indices

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