Two due date assignment problems in scheduling a single machine
From MaRDI portal
Publication:867932
DOI10.1016/J.ORL.2005.10.009zbMATH Open1112.90038OpenAlexW2042776370MaRDI QIDQ867932FDOQ867932
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
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
Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Algorithms for Scheduling Independent Tasks
- Minimizing Total Tardiness on One Machine is NP-Hard
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- Title not available (Why is that?)
- Sequencing with Earliness and Tardiness Penalties: A Review
- Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
- Manufacturing lead-time rules: customer retention versus tardiness costs
- A note on a due-date assignment on a two-machine flow-shop
- Minimizing mean absolute deviation of completion times about a common due date
- Batch scheduling and common due-date assignment on a single machine
- Single-machine sequencing with controllable processing times
- A common due-data assignment problem on parallel identical machines
Cited In (39)
- Two-agent single-machine scheduling with assignable due dates
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Due-date assignment on uniform machines
- Due-date assignment with acceptable lead-times on parallel machines
- A survey on offline scheduling with rejection
- Four single-machine scheduling problems involving due date determination decisions
- Title not available (Why is that?)
- Single machine due date assignment scheduling problem with precedence constraints and controllable processing times in fuzzy environment
- A faster algorithm for a due date assignment problem with tardy jobs
- Scheduling with sub-jobs' due dates
- Title not available (Why is that?)
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- 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
- Single machine \(\text{MAD}/T_{\max}\) problem with a common due date
- On bicriteria scheduling of due date assignment and weighted number of tardy jobs
- Minmax due-date assignment with a time window for acceptable lead-times
- Optimal due date assignment in multi-machine scheduling environments
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
- Optimal restricted due date assignment in scheduling
- Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty
- A new perspective on single-machine scheduling problems with late work related criteria
- Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
- A note: minmax due-date assignment problem with lead-time cost
- A note on ``Two-machine flow-shop scheduling with rejection and its link with flow-shop scheduling and common due date assignment
- Minsum scheduling with acceptable lead-times and optional job rejection
- Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
- The single-machine total tardiness scheduling problem: review and extensions
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
- Due dates assignment and JIT scheduling with equal-size jobs
- Scheduling a single machine with multiple due dates per job
- Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine
- Single machine scheduling with assignable due dates
- Scheduling with due date assignment under special conditions on job processing
- Bicriteria scheduling for due date assignment with total weighted tardiness
- Due-date assignment with asymmetric earliness–tardiness cost
- Proportionate flow shop: new complexity results and models with due date assignment
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)