Single-machine scheduling with positional due indices and positional deadlines

DOI10.1016/J.DISOPT.2019.06.002MaRDI QIDQ2010931zbMATH OpenOpenAlexWikidataFDO

Authors Rubing Chen, Jinjiang Yuan, Lingfa Lu

Publication date 28 November 2019

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2019.06.002

zbMATH Keywords

single-machinepolynomial-timepositional due indicespositional deadlines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single-machine scheduling to minimize total weighted late work with positional due-indices
• Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
• Schedules with due-date assignment and position-dependent processing times
• Single machine scheduling and due date assignment with positionally dependent processing times
• scientific article; zbMATH DE number 2219117

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A data structure for dynamic trees
• A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
• Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
• Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
• Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
• Operating room planning and scheduling: a literature review
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Pareto minimizing total completion time and maximum cost with positional due indices
• Rescheduling to minimize the maximum lateness under the sequence disruptions of original jobs
• Rescheduling with new orders and general maximum allowable time disruptions
• Scheduling algorithms
• Scheduling unit processing time jobs on a single machine with multiple criteria
• Statement forNaval Research Logistics
• Unary NP-hardness of minimizing the number of tardy jobs with deadlines

Cited in

(5)

• Bicriteria scheduling of equal length jobs on uniform parallel machines
• A note on competing-agent Pareto-scheduling
• Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
• Parallel machine scheduling with due date-to-deadline window, order sharing and time value of money
• Single-machine scheduling to minimize total weighted late work with positional due-indices

This page was built for publication: Single-machine scheduling with positional due indices and positional deadlines

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