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

DOI10.1016/S0377-2217(01)00181-3zbMath1009.90054WikidataQ57185986 ScholiaQ57185986MaRDI QIDQ1600949

Chengbin Chu, Jean Marie Proth, Valery S. Gordon

Publication date: 16 June 2002

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

zbMATH Keywords

schedulingsequencingcommon due datedue date assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A survey on scheduling problems with due windows, Proportionate flowshop scheduling with position-dependent weights, Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs, Bicriteria scheduling for due date assignment with total weighted tardiness, Scheduling in supply chain environment, Solving a stochastic single machine problem with initial idle time and quadratic objective, Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work, Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs, A Bicriterion Approach to Due Date Assignment Scheduling in Single-Machine with Position-Dependent Weights, Approaches to Solving Scheduling with Due-Window Assignment and Deterioration Effects, $k$-Fibonacci numbers and $k$-Lucas numbers and associated bipartite graphs, A heuristic for single machine common due date assignment problem with different earliness/tardiness weights, Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs, Just-in-Time Scheduling with Equal-Size Jobs, Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window, Boundary Labeling with Octilinear Leaders, Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection, Multicriteria models for just-in-time scheduling, Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date, Single machine due-date scheduling of jobs with decreasing start-time dependent processing times, A fuzzy-neural knowledge-based system for job completion time prediction and internal due date assignment in a wafer fabrication plant, Real-time prediction of order flowtimes using support vector regression, An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs, A recovering beam search algorithm for the single machine just-in-time scheduling problem, Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity, Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs, Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine, Real-time due-date promising by build-to-order environments, Modelling and integration of customer flexibility in the order commitment process for high mix low volume production, Permutation flow shop scheduling with earliness and tardiness penalties, Due-date assignment on uniform machines, SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT, Multicriteria scheduling, Punctuality and idleness in just-in-time scheduling, Due-date assignment for multi-server multi-stage assembly systems, Scheduling problems with a common due window assignment: A survey, Single-machine serial-batch delivery scheduling with two competing agents and due date assignment, A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem, Optimal due date assignment in multi-machine scheduling environments, Order acceptance and due-date quotation in low machine rates, Machine scheduling with earliness, tardiness and non-execution penalties, Minimizing earliness and tardiness penalties in a single-machine problem with a common due date, Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs, Common due date scheduling with autonomous and induced learning, Single machine common flow allowance scheduling with deteriorating jobs and a rate-modifying activity, Single-machine due-date assignment scheduling with generalized earliness-tardiness penalties including proportional setup times, Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance, A survey of scheduling with controllable processing times, Influence of order acceptance policies on optimal capacity investment with stochastic customer required lead times, A survey of job shop scheduling problem: the types and models, Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance, A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date, 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, Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection, Two due date assignment problems in scheduling a single machine, A mixed integer programming model for advanced planning and scheduling (APS), Order acceptance with weighted tardiness, On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date, Scheduling problems with partially ordered jobs, Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration, A survey on offline scheduling with rejection, Soft due window assignment and scheduling of unit-time jobs on parallel machines, Minmax scheduling problems with common due-date and completion time penalty, Improving delivery reliability by a new due-date setting rule, Due-window assignment problems with unit-time jobs, Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine, Single machine multiple common due dates scheduling with learning effects, Single machine scheduling with controllable release and processing parameters, A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates, Scheduling with due date assignment under special conditions on job processing, A bicriteria approach to scheduling a single machine with job rejection and positional penalties, Single-machine due-window assignment problem with learning effect and deteriorating jobs, Time and work generalised precedence relationships in project scheduling with pre-emption: an application to the management of service centres, Optimal due-date assignment problem with learning effect and resource-dependent processing times, Single-machine scheduling with upper bounded maintenance time under the deteriorating effect, Single-machine common flow allowance scheduling with job-dependent aging effects and a deteriorating maintenance activity, Minmax due-date assignment with a time window for acceptable lead-times, Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration, Single-machine scheduling against due dates with past-sequence-dependent setup times, Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties, A note on the single machine CON and CONW problems with lot scheduling, Group sequencing around a common due date, Due date assignments and scheduling a single machine with a general earliness/tardiness cost function, Exponential neighborhood search for a parallel machine scheduling problem, The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times, A differential evolution approach for the common due date early/tardy job scheduling problem, Four single-machine scheduling problems involving due date determination decisions, Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date, Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times, Minmax due-date assignment on a two-machine flowshop, A note: Common due date assignment for a single machine scheduling with the rate-modifying activity, Skilled workforce scheduling in service centres, Two-agent single-machine scheduling with assignable due dates, Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine, Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs, Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms, An efficient local search for minimizing completion time variance in permutation flow shops, Bicriterion scheduling with a negotiable common due window and resource-dependent processing times, A multi-agent system for the weighted earliness tardiness parallel machine problem, A due-date assignment problem with learning effect and deteriorating jobs, Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning, A note on a due-date assignment on a two-machine flow-shop, Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling, On scheduling around large restrictive common due windows, A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance, A unified approach for scheduling with convex resource consumption functions using positional penalties, Due dates assignment and JIT scheduling with equal-size jobs, Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments, Scheduling with a common due-window: polynomially solvable cases, Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs, Optimal timing of a sequence of tasks with general completion costs, Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem, Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling, Scheduling jobs with position and sum-of-processing-time based processing times, Optimal due date assignment and resource allocation in a group technology scheduling environment, Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval, Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem, Minmax scheduling problems with a common due-window, Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times, A multi-criteria scheduling with due-window assignment problem, Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms, Revenue management and demand fulfillment: Matching applications, models, and software, Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries, Scheduling identical jobs and due-window on uniform machines, Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations, A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines, Due date assignment scheduling with positional-dependent weights and proportional setup times, A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs, A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems, Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains, Due-window assignment with identical jobs on parallel uniform machines, Trading off due-date tightness and job tardiness in a basic scheduling model, Minimizing earliness and tardiness costs in stochastic scheduling, Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs

Cites Work

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