A single machine group scheduling problem with due date assignment and position-dependent costs

DOI10.1142/S0217595923400079MaRDI QIDQ6542871zbMATH OpenFDO

Authors Ying Chen, Yi Xu, Gui-Qing Zhang, Yongxi Cheng

Publication date 23 May 2024

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0217595923400079

zbMATH Keywords

due date assignmentgroup technologyposition-dependent costssingle machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Common due-window assignment and group scheduling with position-dependent processing times
• Group scheduling on a single machine with due date assignment and learning effects
• Single machine scheduling and due date assignment with positionally dependent processing times
• Single machine scheduling problem with multiple due windows assignment in a group technology
• On optimal due date assignment without restriction and resource allocation in group technology scheduling

Cites work

• A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
• A comprehensive review of flowshop group scheduling literature
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Due-window assignment scheduling in the proportionate flow shop setting
• Group maintenance scheduling for two-component systems with failure interaction
• scientific article; zbMATH DE number 1634827 (Why is no real title available?)
• Optimal due date assignment and resource allocation in a group technology scheduling environment
• Optimal restricted due date assignment in scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Single-machine group scheduling with processing times dependent on position, starting time and allotted resource
• Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty

Cited in

(5)

• Optimal policies for minimizing total job completion times and deviations from common due dates in unrelated parallel machine scheduling
• Study on single-machine group scheduling with convex resource allocations and different due-date assignments
• No-idle flow shop scheduling with deteriorating jobs and common due date under dominating machines
• Single machine group scheduling jobs with resource allocations subject to unrestricted due date assignments
• Optimal due date assignment in a single machine group technology scheduling environment with learning effect

This page was built for publication: A single machine group scheduling problem with due date assignment and position-dependent costs

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