A survey of the state-of-the-art of common due date assignment and scheduling research

DOI10.1016/S0377-2217(01)00181-3zbMATH Open1009.90054WikidataQ57185986 ScholiaQ57185986MaRDI QIDQ1600949FDOQ1600949

Authors: Chengbin Chu, V. S. Gordon, Jean Marie Proth 

Publication date: 16 June 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Recommendations

• Multiple common due dates
• A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
• A common due-data assignment problem on parallel identical machines
• Scheduling under a common due-date on parallel unrelated machines
• Common due date assignment and scheduling with ready times

zbMATH Keywords

schedulingsequencingdue date assignmentcommon due date

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Earliness-Tardiness Scheduling Around Almost Equal Due Dates
• Regression-based due date assignment rules for improved assembly shop performance
• Form Similarities of the CON and SLK Due Date Determination Methods
• New results on the completion time variance minimization
• Title not available (Why is that?)
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• Algorithms for minclique scheduling problems
• 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
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
• Title not available (Why is that?)
• A state-of-the-art review of parallel-machine scheduling research
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
• Title not available (Why is that?)
• Title not available (Why is that?)
• Scheduling independent tasks to reduce mean finishing time
• Survey of scheduling research involving due date determination decisions
• On the complexity of generalized due date scheduling problems
• Scheduling around a small common due date
• Title not available (Why is that?)
• Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Due-date assignment and early/tardy scheduling on identical parallel machines
• Single-machine scheduling with learning considerations
• Scheduling with monotonous earliness and tardiness penalties
• Common due window size and location determination in a single machine scheduling problem
• Sequencing with Earliness and Tardiness Penalties: A Review
• A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Title not available (Why is that?)
• Single-machine scheduling with early and tardy completion costs
• Minimizing the maximum deviation of job completion time about a common due-date
• Multiple-machine scheduling with earliness, tardiness and completion time penalties
• On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
• Two parallel machine sequencing problems involving controllable job processing times
• Completion time variance minimization on a single machine is difficult
• The complexity of scheduling job families about a common due date
• A Generalized Model of Optimal Due-Date Assignment by Linear Programming
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• On the Assignment of Optimal Due Dates
• The parallel machine min-max weighted absolute lateness scheduling problem
• The Total Tardiness Problem: Review and Extensions
• Title not available (Why is that?)
• Variance Minimization in Single Machine Sequencing Problems
• Scheduling shops to minimize the weighted number of late jobs
• Title not available (Why is that?)
• Scheduling under a common due-date on parallel unrelated machines
• Minimizing mean absolute deviation of completion times about a common due date
• Title not available (Why is that?)
• Batch scheduling and common due-date assignment on a single machine
• Minimizing tardy jobs in a flowshop with common due date
• Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
• Single-machine scheduling with a common due window
• Optimal common due-date with limited completion time deviation
• Mimimization of agreeably weighted variance in single machine systems
• Minimizing the average deviation of job completion times about a common due date
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• CON due-date determination and sequencing
• Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Title not available (Why is that?)
• Single machine scheduling with common due data assignment in a group technology environment
• Determination of common due window location in a single machine scheduling problem
• Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times
• Single-machine sequencing with controllable processing times
• Optimal common due-date with completion time tolerance
• Optimal common due-date with limited completion time
• Minimizing flow time variance in a single machine system using genetic algorithms
• Scheduling job families about an unrestricted common due date on a single machine
• Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
• Integrating order release control with due-date assignment rules
• Using tabu search to solve the common due date early/tardy machine scheduling problem
• The weighted common due date single machine scheduling problem revisited
• Single- and multiple-processor models for minimizing completion time variance
• Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• An algorithm for the CON due-date determination and sequencing problem
• Determination of an optimal common due date and optimal sequence in a single machine job shop
• Note—A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date
• Scheduling about a common due date with earliness and tardiness penalties
• A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem
• Common due-date determination and sequencing using tabu search
• A V-shape property of optimal schedule of jobs about a common due date
• Scheduling problems with non-regular penalty functions - a review
• Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
• An alternative proof of optimality for the common due-date assignment problem
• Equivalence of mean flow time problems and mean absolute deviation problems
• Common due date scheduling problem with separate earliness and tardiness penalties
• Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties
• On the general solution for a class of early/tardy problems
• DETERMINISTIC SCHEDULING IN COMPUTER SYSTEMS: A SURVEY
• Title not available (Why is that?)
• Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines
• New Lower and Upper Bounds for Scheduling Around a Small Common Due Date
• Title not available (Why is that?)
• Title not available (Why is that?)
• Batch scheduling and common due date assignment problem: An NP-hard case
• Title not available (Why is that?)
• An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
• Dynamic assignation of due-dates in an assembly shop based in simulation
• Title not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Two-agent single-machine scheduling with assignable due dates
• Scheduling problems with partially ordered jobs
• Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs
• Trading off due-date tightness and job tardiness in a basic scheduling model
• Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
• Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs
• Exponential neighborhood search for a parallel machine scheduling problem
• An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs
• Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs
• Due-date assignment on uniform machines
• A survey on offline scheduling with rejection
• Single-machine scheduling with upper bounded maintenance time under the deteriorating effect
• Minimizing earliness and tardiness costs in stochastic scheduling
• Four single-machine scheduling problems involving due date determination decisions
• On scheduling around large restrictive common due windows
• Real-time due-date promising by build-to-order environments
• Permutation flow shop scheduling with earliness and tardiness penalties
• A unified approach for scheduling with convex resource consumption functions using positional penalties
• Optimal due-date assignment problem with learning effect and resource-dependent processing times
• Influence of order acceptance policies on optimal capacity investment with stochastic customer required lead times
• Scheduling jobs with position and sum-of-processing-time based processing times
• Common due date scheduling with autonomous and induced learning
• Time and work generalised precedence relationships in project scheduling with pre-emption: an application to the management of service centres
• A bicriteria approach to scheduling a single machine with job rejection and positional penalties
• A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
• Multiple common due dates
• Single-machine due-window assignment problem with learning effect and deteriorating jobs
• Optimal due date assignment in multi-machine scheduling environments
• Skilled workforce scheduling in service centres
• Survey of scheduling research involving due date determination decisions
• A survey of scheduling with controllable processing times
• Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
• Single machine scheduling with controllable release and processing parameters
• Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
• A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
• Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
• Order acceptance with weighted tardiness
• A note: minmax due-date assignment problem with lead-time cost
• Setting optimal due dates in a basic safe-scheduling model
• Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
• Optimal timing of a sequence of tasks with general completion costs
• Single-machine scheduling against due dates with past-sequence-dependent setup times
• Scheduling identical jobs and due-window on uniform machines
• Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration
• Single machine due-date scheduling of jobs with decreasing start-time dependent processing times
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning
• Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
• Two due date assignment problems in scheduling a single machine
• Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration
• Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
• Minmax scheduling problems with a common due-window
• 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
• Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
• A survey on scheduling problems with due windows
• A note: Common due date assignment for a single machine scheduling with the rate-modifying activity
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
• Due dates assignment and JIT scheduling with equal-size jobs
• Optimal due date assignment and resource allocation in a group technology scheduling environment
• A differential evolution approach for the common due date early/tardy job scheduling problem
• Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
• A due-date assignment problem with learning effect and deteriorating jobs
• Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times
• Improving delivery reliability by a new due-date setting rule
• Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
• Single machine multiple common due dates scheduling with learning effects
• Multicriteria scheduling
• Machine scheduling with earliness, tardiness and non-execution penalties
• Revenue management and demand fulfillment: Matching applications, models, and software
• Scheduling with due date assignment under special conditions on job processing
• Scheduling with a common due-window: polynomially solvable cases
• Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
• A recovering beam search algorithm for the single machine just-in-time scheduling problem
• A multi-agent system for the weighted earliness tardiness parallel machine problem
• An efficient local search for minimizing completion time variance in permutation flow shops
• A note on a due-date assignment on a two-machine flow-shop
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
• Integrated production and transportation scheduling problem under nonlinear cost structures
• Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
• Minmax common due-window assignment scheduling with deteriorating jobs
• Modelling and integration of customer flexibility in the order commitment process for high mix low volume production
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• Scheduling in supply chain environment
• New exact and heuristic algorithms for general production and delivery integration
• Due-date assignment with acceptable lead-times on parallel machines
• Self-adaptive biased differential evolution for scheduling against common due dates
• Single machine due date assignment scheduling problem with precedence constraints and controllable processing times in fuzzy environment
• Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling
• Just-in-time scheduling with equal-size jobs
• Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date
• Minmax due-date assignment on a two-machine flowshop
• A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date
• Bicriterion scheduling with a negotiable common due window and resource-dependent processing times
• Order acceptance and due-date quotation in low machine rates
• Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs
• A heuristic for single machine common due date assignment problem with different earliness/tardiness weights
• Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window
• Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs

This page was built for publication: A survey of the state-of-the-art of common due date assignment and scheduling research

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