Optimal restricted due date assignment in scheduling
From MaRDI portal
Publication:322834
DOI10.1016/j.ejor.2015.12.043zbMath1346.90387OpenAlexW2197036196MaRDI QIDQ322834
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.12.043
Related Items
Optimal due date assignment without restriction and convex resource allocation in group technology scheduling, Bicriteria scheduling for due date assignment with total weighted tardiness, Just-in-time scheduling for a distributed concrete precast flow shop system, Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work, A Bicriterion Approach to Due Date Assignment Scheduling in Single-Machine with Position-Dependent Weights, A new perspective on single-machine scheduling problems with late work related criteria, On optimal due date assignment without restriction and resource allocation in group technology scheduling, Flow Shop Resource Allocation Scheduling with Due Date Assignment, Learning Effect and Position-Dependent Weights, Hybrid differential evolution optimisation for Earth observation satellite scheduling with time-dependent earliness-tardiness penalties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
- Optimal due date assignment in multi-machine scheduling environments
- Scheduling jobs with equal processing times and time windows on identical parallel machines
- Two due date assignment problems in scheduling a single machine
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
- Parallel machine scheduling with earliness and tardiness penalties
- Approximation algorithms for shop scheduling problems with minsum objective
- Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
- Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
- Single machine scheduling to minimize total weighted tardiness
- Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
- Machine scheduling with earliness, tardiness and non-execution penalties
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
- Scheduling unit-length jobs with machine eligibility restrictions
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
- Convex quadratic and semidefinite programming relaxations in scheduling
- Minimizing Total Tardiness on One Machine is NP-Hard
- Sequencing with Earliness and Tardiness Penalties: A Review
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Scheduling the Open Shop to Minimize Mean Flow Time
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Single-machine scheduling with early and tardy completion costs
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
