Single-machine scheduling with positional due indices and positional deadlines

DOI10.1016/J.DISOPT.2019.06.002zbMATH Open1506.90096OpenAlexW2959197991WikidataQ127590499 ScholiaQ127590499MaRDI QIDQ2010931FDOQ2010931

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

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

zbMATH Keywords

single-machinepolynomial-timepositional due indicespositional deadlines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
• A data structure for dynamic trees
• Scheduling unit processing time jobs on a single machine with multiple criteria
• Operating room planning and scheduling: a literature review
• Scheduling algorithms
• Statement forNaval Research Logistics
• Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
• Rescheduling with new orders and general maximum allowable time disruptions
• Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs
• Pareto minimizing total completion time and maximum cost with positional due indices
• Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
• Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
• Unary NP-hardness of minimizing the number of tardy jobs with deadlines

Cited In (4)

• 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

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)