Two due date assignment problems in scheduling a single machine

DOI10.1016/J.ORL.2005.10.009MaRDI QIDQ867932zbMATH OpenOpenAlexFDO

Authors Dvir Shabtay, George Steiner

Publication date 19 February 2007

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2005.10.009

zbMATH Keywords

due date assignmentsingle-machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 3914067
• Two-agent single-machine scheduling with assignable due dates
• Single machine scheduling problem with common due date
• Single machine scheduling and due date assignment with positionally dependent processing times
• On single machine scheduling and due dateassignment with positionally dependent processing times
• Single machine scheduling with assignable due dates
• Scheduling with generalized and periodic due dates under single- and two-machine environments
• Scheduling of single machine with deteriorating jobs and due-date assignment
• Due-date assignment and single machine scheduling with deteriorating jobs
• Single machine scheduling with a common due date: total weighted tardiness problems

Cites work

• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• A common due-data assignment problem on parallel identical machines
• A note on a due-date assignment on a two-machine flow-shop
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Algorithms for Scheduling Independent Tasks
• Batch scheduling and common due-date assignment on a single machine
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Manufacturing lead-time rules: customer retention versus tardiness costs
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Minimizing Total Tardiness on One Machine is NP-Hard
• Minimizing mean absolute deviation of completion times about a common due date
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
• Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
• Sequencing with Earliness and Tardiness Penalties: A Review
• Single-machine sequencing with controllable processing times

Cited in

(39)

• Minmax due-date assignment with a time window for acceptable lead-times
• Minsum scheduling with acceptable lead-times and optional job rejection
• scientific article; zbMATH DE number 1731175 (Why is no real title available?)
• Single machine scheduling with assignable due dates
• Two-agent single-machine scheduling with assignable due dates
• A new perspective on single-machine scheduling problems with late work related criteria
• Due-date assignment with asymmetric earliness–tardiness cost
• Single machine due date assignment scheduling problem with precedence constraints and controllable processing times in fuzzy environment
• Scheduling a single machine with multiple due dates per job
• Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs
• A unified approach for scheduling with convex resource consumption functions using positional penalties
• Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
• Due-date assignment on uniform machines
• A faster algorithm for a due date assignment problem with tardy jobs
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Due dates assignment and JIT scheduling with equal-size jobs
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
• Scheduling with sub-jobs' due dates
• Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
• Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
• On bicriteria scheduling of due date assignment and weighted number of tardy jobs
• The single-machine total tardiness scheduling problem: review and extensions
• Proportionate flow shop: new complexity results and models with due date assignment
• Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty
• Four single-machine scheduling problems involving due date determination decisions
• Scheduling with due date assignment under special conditions on job processing
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• Optimal due date assignment in multi-machine scheduling environments
• Optimal restricted due date assignment in scheduling
• scientific article; zbMATH DE number 3914067 (Why is no real title available?)
• Due-date assignment with acceptable lead-times on parallel machines
• Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
• Bicriteria scheduling for due date assignment with total weighted tardiness
• A note: minmax due-date assignment problem with lead-time cost
• Single machine \(\text{MAD}/T_{\max}\) problem with a common due date
• A note on ``Two-machine flow-shop scheduling with rejection and its link with flow-shop scheduling and common due date assignment
• Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine
• A survey on offline scheduling with rejection
• Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine

This page was built for publication: Two due date assignment problems in scheduling a single machine

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