Single-machine scheduling with positional due indices and positional deadlines

DOI10.1016/j.disopt.2019.06.002zbMath1506.90096OpenAlexW2959197991WikidataQ127590499 ScholiaQ127590499MaRDI QIDQ2010931

Jinjiang Yuan, Rubing Chen, Ling-Fa 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)

Related Items (3)

A note on competing-agent Pareto-scheduling ⋮ Bicriteria scheduling of equal length jobs on uniform parallel machines ⋮ Parallel Machine Scheduling with Due Date-to-Deadline Window, Order Sharing and Time Value of Money

Cites Work

• Unnamed Item
• Unnamed Item
• Rescheduling with new orders and general maximum allowable time disruptions
• Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
• Pareto minimizing total completion time and maximum cost with positional due indices
• Operating room planning and scheduling: a literature review
• 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
• Scheduling unit processing time jobs on a single machine with multiple criteria
• A data structure for dynamic trees
• Unary NP-hardness of minimizing the number of tardy jobs with deadlines
• Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs
• Statement forNaval Research Logistics

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